Give the linear programming model for this problem. (Let x_ij represent the flow from node i to node j where iand j are the node numbers.)

Min

s.t.

Node 1 Flows

Node 2 Flows

Node 3 Flows

Node 4 Flows

Node 5 Flows

Node 6 Flows

Node 7 Flows

all x_ij 0.

Canning Transport is to move goods from three factories to three distribution centers. Information about the move is given below. The shipping costs are given below. Give the linear programming model for this problem. (Let xij represent the flow from node i to node j where i and j are the node numbers.) Min s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7 Flows all xij0