2 (10pts). Use cutting plane algorithm to solve the following integer program. max 1+22 s.t. -x1+2+x3...

 

Transcribed Image Text:

2 (10pts). Use cutting plane algorithm to solve the following integer program. max 1+22 s.t. -x1+2+x3 = 2; 7x1+3x2 <21 x1, x2, x3 ZU {0}. 3 (10pts). State the Primal-dual algorithm for an linear programming. 4 (10pts). (1) Given a flow network N = (s, t, V, E, b), formulate the maximum flow problem of N into a linear programming. (2) Formulate the dual problem of the maximum flow problem, and explain why the dual of maximum flow problem is corresponding to a minimum cut problem of the network. 2 (10pts). Use cutting plane algorithm to solve the following integer program. max 1+22 s.t. -x1+2+x3 = 2; 7x1+3x2 <21 x1, x2, x3 ZU {0}. 3 (10pts). State the Primal-dual algorithm for an linear programming. 4 (10pts). (1) Given a flow network N = (s, t, V, E, b), formulate the maximum flow problem of N into a linear programming. (2) Formulate the dual problem of the maximum flow problem, and explain why the dual of maximum flow problem is corresponding to a minimum cut problem of the network.