1. In a transportation problem, items are allocated from sources to destinations at a minimum cost. 2. The transportation model of linear programming assumes homogeneous commodities, deterministic supply, deterministic demand, that every source is capable of shipping to every destination, and that there is a known per-unit shipping cost from every source to every destination. 3. The total transportation cost of a set of shipments for the transportation model is the sum of th products of the per-unit shipping costs rmtiplied by the shipment amounts. 4. The transportation model is used to identify the optimum shipping plan for a given transportation proble 5. The transportation model is used to identify the optimum shipping plan for a given transportation proble 6. Transportation problems always have integer solutions if the supplies and demands are all integer. 7. When demand and supply are not equal in a transportation problem then the problem can be reformulate and solved. 8. The linear programming model for a transportation problem has constraints for supply at each source an- demand at each destination. 9. In a balanced transportation model where supply equals demand, all constraints are equalities . 0. In the linear programming formulation of the transshipment problem there is one constraint for each nod 1. Transportation problems are concerned with distributing commodities om sources to destinations in su way as to maximize the total amount shipped. 2. The transportation model is a special type of linear regression model. 3. A dummy origin is used when the supply is greater than the demand. 4. When an empty cell is lled articially in order to complete a degenerate solution of the transportation model, the lled cell is called a dummy