Solve the following problem by the Dantzig-Wolfe decomposition technique using a single convexity: minimize z= −2x₁+x2–5

[answerhappygod]

Solve The Following Problem By The Dantzig Wolfe Decomposition Technique Using A Single Convexity Minimize Z 2x X2 5 1 (200.37 KiB) Viewed 15 times

Solve the following problem by the Dantzig-Wolfe decomposition technique using a single convexity: minimize z= −2x₁+x2–5x3, subject to 6x₁-x2 +3x3 ≤ 4, 0 ≤ x ≤ 1, i = 1, 2, 3, 4. Keep the first constraint in the master problem. Note that the sub-problem can be partitioned in four independent LP's with bounds on the variables. Each time you solve the sub-problem, consolidate the solutions of the four LP's into a single column for the master problem.