Hitchcock transportation problem

Hitchcock transportation problem

[¦hich‚käk ‚tranz·pər′tā·shən ‚präb·ləm]
(mathematics)
The problem in linear programming of minimizing the cost of moving ships between two configurations in both of which there is a specified number of ships in each of a finite number of ports, when the costs of moving one ship from each of the ports in the first configuration to each of the ports in the second are specified.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.