Exercise 6.3 Consider the following linear programming problem: + X22 - 323 maximize subject to 212 X11 + 12 + X13 221 +222 + 323 -X11 - 221 20 20 - 20 -10 -10 15 212 -- 222 213 223 + X23 0, for all i, j. We wish to solve this problem using Dantzig-Wolfe decomposition, where the constraint X11 + x23 0, for all i, j. We wish to solve this problem using Dantzig-Wolfe decomposition, where the constraint X11 + x23