a) Identify the easy constraints set (variable separable constraints).

(b) Identify one extreme point of the easy constraint set. Write the Dantzig Wolfe's Restricted Master Problem (RMP) in standard form using the extreme point.

(c) Solve the RMP using the revised simplex method.

(d) Build the sub-problem using the dual variables of the RMP. Solve the sub-problem (maybe graphi- cally), and identify the entering column in RMP.

(e) Add the entering column into the revised simplex tableau and identify the leaving variable. Update the revised simplex tableau.

(f) Repeat Steps give in Part (d) & (e) until you hit optimal solution or unbounded direction.

Consider the following LP: Maximize3x1+5x2+2x3+3x4subjectto2x1+4x2+5x3+2x472x1+3x26x1+4x243x3+4x4124x43x1,x2,x3,x40. (a) Identify the easy constraints set (variable separable constraints). (b) Identify one extreme point of the easy constraint set. Write the Dantzig Wolfe's Restricted Master Problem (RMP) in standard form using the extreme point. (c) Solve the RMP using the revised simplex method. (d) Build the sub-problem using the dual variables of the RMP. Solve the sub-problem (maybe graphically), and identify the entering column in RMP. (e) Add the entering column into the revised simplex tableau and identify the leaving variable. Update the revised simplex tableau. (f) Repeat Steps give in Part (d) \& (e) until you hit optimal solution or unbounded direction