# Linear programming, Maximise Z

Maximise $Z = X_1 -2X_2$

Such that

$3X_1 + X_2 \ge 3$

$2X_1 - X_2 \le 5$

$X_1, X_2 \ge 0$

I've done using CET. Find out that $\max(Z)=-6$ when $X_1=0$, $X_2=3$ which is feasible.

But i really dont know how to solve it by 2-phase method.

Is there anyone who can help me solve this?