Put the problem is standard form. The identity block is negative, so put it in canonic form. From there, you

should be able to use the dual simplex in two iterations to solve the problem.

a$)$ Using the simplex method solve

minimize,$2x_1-x_2$

subject $to2x_1-x_2-x_{3}3$

$,x_1-x_2+x_{3}2$

$,x_{i}0,i=1,2,3.$

$($Hint: Note that $x_1=2$ gives a feasible solution.$)$

b$)$ What is the dual problem and its optimal solution?