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 3x11 3x12 3x13 2x21 2x22 25 2x11 2x12 2x13  x21  x22 10 and 0 x11 2 0 x21 3 0 x12 3 0 x22 1.

0 x13 What was the mathematical model for the original problem?

(You may define the objective function either algebraically or graphically, but express the constraints algebraically.)