Suppose that the separable programming technique has been applied to a certain problem (the original problem) to

Suppose that the separable programming technique has been applied to a certain problem (the €œoriginal problem€) to convert it to the following equivalent linear programming problem: Maximize Z = 5x11 + 4x12 + 2x13 + 4x21 + x22,
subject to

and

What was the mathematical model for the original problem? (You may define the objective function either algebraically or graphically, but express the constraints algebraically.)

Transcribed Image Text:

3x11 + 3x12 + 3x13 +2p21 + 2x22 2nı + x12 + 2x13-x21-x22 25 10 302 . 2 3 0 0 S 113