Solve using simplex method :

Solve the following linear programming problem: Maximize Z = 4 X1 + 6 X2 + 3X3 + 1 X4

Subject to X1 0;

X2 0; X3 0;

X4 0 and

1.5 X1 + 2 X2 + 4 X3 + 3 X4 550

4 X1 + 1 X2 + 2 X3 + 1 X4 700

2 X1 + 3 X2 + 1 X3 + 2 X4 200