For reference:

Consider the transportation problem having the following parameter table:

		Distribution
Source		1	2	Supply
	A	8	5	4
	B	6	4	2
Demand		3	3

(a) Using the northwest corner rule for obtaining the initial BF solution, solve this problem manually by the transportation simplex method.

(b) Reformulate this problem as a general linear programming problem, and then solve it manually by the simplex method. Keep track of how long this takes you, and contrast it with the computation time for part (a

9.1-6. The Move-It Company has two plants producing forklift trucks that then are shipped to three distribution centers. The production costs are the same at the two plants, and the cost of shipping for each truck is shown for each combination of plant and distribution center: A total of 60 forklift trucks are produced and shipped per week. Each plant can produce and ship any amount up to a maximum of 50 trucks per week, so there is considerable flexibility on how to divide the total production between the two plants so as to reduce shipping costs. However, each distribution center must receive exactly 20 trucks per week. Management's objective is to determine how many forklift trucks should be produced at each plant, and then what the overall shipping pattern should be to minimize total shipping cost. (a) Formulate this problem as a transportation problem by constructing the appropriate parameter table. (b) Display the transportation problem on an Excel spreadsheet. C (c) Use Solver to obtain an optimal solution