Assignment $1$ v$3(2).$pdf

Dresding case s$...$

Goal Program...

Create

Convert E$-$Sign

Find text or tools

Question $3$

$(25$ marks$)$

Consider the following resource allocation problem.

maxz$=-x_1+2x_2-x_3$

s$.$t

$][3$

Profit $($R$)$

Resource $1$

Resource $2$

Resource $3$

a$)$ Do one iteration of the simplex method

$(7$ marks$)$

The corresponding optimal tableau of this LP is given by:

$\backslash$table$[[z,\backslash$table$[[x_1$