1. Adirondack Paper Mills, Inc.operates paper plants in Augusta, Maine, andTupper Lake, New York.Warehouse facilities are located in Albany, New York,and Portsmouth, New Hampshire.Distributors are located in Boston, New York,andPhiladelphia.TheAugustaplanthasacapacityof300units,andtheTupper

Lake plant has a capacity of 100 units.Boston has a demand of 150 units, NewYork has a demand of 100 units, and Philadelphia has a demand of 150 units. Theunit transportation costs (in dollars) for shipments from the two plants to the twowarehousesarepresentedinTable4andthosefromthetwowarehousestothethreedistributorsarepresentedinTable5.

Table4:Problem1.10a

Plant/Warehouse	Albany	Portsmouth
Augusta	7	5
TupperLake	3	4

Table5:Problem1.10b

Warehouse/Distributor	Boston	NewYork	Philadelphia
Albany	8	5	7
Portsmouth	5	6	10

1. DrawthenetworkrepresentationoftheAdirondackPaperMillsproblem.
2. FormulatetheAdirondackPaperMillsproblemasalinearprogrammingproblem.
3. Solvethelinearprogramtodeterminetheminimumcostshippingschedulefortheproblem.