Question 1:

Since all Zj-Cj≥0

Hence, optimal solution is arrived with value of variables as :

x=3,y=0

Max Z=3

Question 2:

a. Weight of minimum spanning tree with prism algorithm is 14.

b. Shortest path length using Dijkstra starting with node O and end at node T is 10
Path = O -> A -> D -> T
Question 3:

a. A flow in G from s to t is an allocation of “current” to each edge of G, such that the net
current entering any vertex v not equal to s, t equals 0.
Let f∗ be a flow of value k if one exists; if the max flow has value k, then such a flow
exists.
b. Maximum flow from S –T is 8 and augmented path is

c. The value of the maximum flow is equal to the value of the minimum cut so the
minimum cut is 8
d. The capacity of an s-t cut is defined by the sum of the capacity of each edge in the cut-
set. 
A-T AND C-T total capacity = 8
e. Maximum flow as linear programming

f. Minimum cut as mixed-integer linear programming