Problem -
Adirondack Paper Mills, Inc., operates paper plants in Augusta, Maine, and Tupper Lake, New York. Warehouse facilities are located in Albany, New York, and Portsmouth. New Hampshire. Distributors are located in Boston, New York, and Philadelphia. The plant capacities and distributor demands for the next month are as follows:
|
Plant
|
Capacity (units)
|
Distributor
|
Demand (units)
|
|
Augusta
|
300
|
Boston
|
150
|
|
Tupper Lake
|
100
|
New York
|
100
|
|
|
|
Philadelphia
|
150
|
The unit transportation costs (in dollars) for shipments from the two plants to the two warehouses and from the two warehouses to the three distributors are as follows:
|
Warehouse
|
|
Plant
|
Albany
|
Portsmouth
|
|
Augusta
|
7
|
5
|
|
Tupper Lake
|
3
|
4
|
|
Distributor
|
|
Warehouse
|
Boston
|
New York
|
Philadelphia
|
|
Albany
|
8
|
5
|
7
|
|
Portsmouth
|
5
|
6
|
10
|
a. Draw the network representation of the Adirondack Paper Mills problem.
b. Formulate the Adirondack Paper Mills problem as a linear programming problem.
c. Solve the linear program to determine the minimum cost shipping schedule for the problem.