2. Draw the network for this transportation problem.

Min	6xAX + 3xAY + 5xAZ+ 9xBX + 12xBY + 8xBZ
s.t.	xAX + xAY + xAZ<= 600
	xBX + xBY + xBZ <= 500
	xAX + xBX = 350
	xAY + xBY = 300
	xAZ + xBZ = 400
	xij >= 0

3. Canning Transport is to move goods from three factories to three distribution centers. Information about the move is given below. Give the linear programming model for this problem.

Source	Supply	Destination	Demand
A	200	X	150
B	220	Y	125
C	150	Z	125

Shipping costs are:

	Destination
Source	X	Y	Z
A	3	2	5
B	8	10	--
C	6	5	4
	(Source B cannot ship to destination Z)