Reformulate this problem (except for the equality restriction) to fit our standard form of linear programming model.

Max (Z) = -2X1 + X2 - 4X3 + 3X4

Subject to

X1 + X2 + X3 +2X4

X1 - X3 + X4 >= -1

2X1 + X2

X1 + 2X2 +X3 +2X4 = 2

X1, X2, X3, X4 >= 0

Reformulate this problem (except for the equality restriction) to fit our standard form of linear programming model. Max(Z)=21+X243+34 Subject to X1+X2+X3+24=121+X2=0