In transportation models designed in linear programming, points of demand is classified as
A. Ordination
B. Transportation
C. Destinations
D. Origins

Hint: In this question, we need to write the definitions of all the four given options in order to understand the question properly. Generally, ordination means arrangement of species and samples. Transportation means the product is being taken from origin to the place where required. Destination means where the product is required. Origin means the place from where the product originates.

Complete step by step solution:
Let’s discuss all the definitions option wise.
Option A) Ordination: Ordination is the arrangement of species and samples along gradients. Indeed, ordination can be considered as a synonym for multivariate gradient analysis. Therefore, before discussing ordination, it is necessary to describe an underlying model of species responses to gradients. Generally, ordination techniques are used in ecology to describe relationships between species composition patterns and the underlying environmental gradients.
So, option A is incorrect.

Option B) Transportation: The transportation method of linear programming is applied to the problems related to the study of efficient transportation routes that is how efficiently the product from different sources of production is transported to different destinations such as the total transportation cost is minimum.
So, option B is also incorrect.

Option D) Origins: Origins in linear programming means the place from where the product gets originated or manufactured for being transported to where the product is required.
So, option D is also incorrect.

Option C) Destinations: In linear programming, transportation models are applied to problems related to the study of efficient transportation routes. That is, how effectively the available resources are transported to different destinations with minimum cost. Therefore, the points of demand are termed as destinations.

So, the correct answer is “Option C”.

Note: Linear programming is a method to achieve the best outcome in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming.