Draw the network for this transportation problem. (Letx_ijrepresent the flow from nodeito nodej.)

Min 2x₁₃+4x₁₄+4x₁₅+8x₂₃+13x₂₄+9x₂₅

s.t.
	x13+x14+x15		500
	x23+x24+x25		400
	x13+x23	=	300
	x14+x24	=	300
	x15+x25	=	300
	xij0

A graph with 5 nodes and 6 directed arcs is shown.

• Node 1 with value 500 is connected to node 3 with value 300 by arc of value 2, to node 4 with value 300 by arc of value 4, and to node 5 with value 300 by arc of value 4.
• Node 2 with value 400 is connected to node 3 with value 300 by arc of value 8, to node 4 with value 300 by arc of value 13, and to node 5 with value 300 by arc of value 9.
• Node 3 with value 300 has no directed arcs directed to other nodes.
• Node 4 with value 300 has no directed arcs directed to other nodes.
• Node 5 with value 300 has no directed arcs directed to other nodes.

A graph with 5 nodes and 6 directed arcs is shown.

• Node 1 with value 300 is connected to node 4 with value 400 by arc of value 9 and to node 5 with value 500 by arc of value 13.
• Node 2 with value 300 is connected to node 4 with value 400 by arc of value 8 and to node 5 with value 500 by arc of value 4.
• Node 3 with value 300 is connected to node 4 with value 400 by arc of value 4 and to node 5 with value 500 by arc of value 2.
• Node 4 with value 400 has no directed arcs directed to other nodes.
• Node 5 with value 500 has no directed arcs directed to other nodes.

A graph with 5 nodes and 6 directed arcs is shown.

• Node 1 with value 500 is connected to node 4 with value 300 by arc of value 2 and to node 5 with value 300 by arc of value 4.
• Node 2 with value 400 is connected to node 4 with value 300 by arc of value 4 and to node 5 with value 300 by arc of value 8.
• Node 3 with value 300 is connected to node 4 with value 300 by arc of value 13 and to node 5 with value 300 by arc of value 9.
• Node 4 with value 300 has no directed arcs directed to other nodes.
• Node 5 with value 300 has no directed arcs directed to other nodes.