transportation problem

Show Summary Details

Quick Reference

A linear programming problem concerned with identifying the cheapest method for moving commodities (or people) from one set of locations to another. At locations L1, L2,…, Ll specified amounts of a commodity are available. There are demands for specified amounts of the commodity at locations M1, M2,…, Mm. The cost of transportation from Lj to Mk is known for all j and k. The problem is to satisfy the demands at minimum transportation cost.

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.