Aggregate Planning via

Transportation Method
of Linear Programming

 A fictive

corporation A has a contract to supply motors for all tractors

produced by a fictive corporation B. Corporation B manufactures the
tractors at three locations around Central Europe: Prague, Warsaw,
and Budapest. Plans call for the following numbers of tractors to be
produced at each location:

Prague 9 000
Warsaw 12 000
Budapest 9 000
Corporation

A has four plants that can produce the motors. The plants
and production capacities are

Hamburg 8 000
Munich 7 000
Leipzig 10 000
Dresden 5 000

 Objective:

Find the minimum cost of

transporting supply motors for all
tractors produced by a fictive
corporation B using transportation
Method via Linear Programming

Transportation Table