node s to node t can be formulated by a linear program as follows: where the decision variable x, denotes the flow on the link (i, ) and the decision variable x, indicates the maximum flow that can be sent from node s to node t. Using the duality table in page 1 to find the dual problem of this one.
Fig: 1
Fig: 2
Fig: 3
Fig: 4