Consider the following linear programming problem.
Maximize Z = 2x1 + 4x2 + 3x3 + 2x4 + 5x5 + 3x6,
subject to

and
xj ‰¥ 0, for j = 1, 2, . . . , 6.
(a) Rewrite this problem in a form that demonstrates that it possesses the special structure for multidivisional problems. Identify the variables and constraints for the master problem and each subproblem.
(b) Construct the corresponding table of constraint coefficients having the block angular structure shown in Table 23.4. (Include only nonzero coefficients, and draw a box around each block of these coefficients to emphasize this structure.)

3x1 + 2x2 + 3x3 30 5x1-2x2 + 3x3 + 4x4 + 2xs+ 3 s15 2rs +316 40 2x1 + 4x2 + 2x4 + 3x6 60