Rearrange the objective function $P=x1-2+53$ so that it can be maximized inside a simplex tableau.

Using the information below to write the initial simplex tableau. Be sure to name the top and sides with the appropriate variables.

Maximize $N=201+52$

$621+80254$

$421+10m262$

subject to

$x10$

$x20$

Using the information below to write the initial simplex tableau. Be sure to name the top and sides with the appropriate variables.

Maximize $N=121+242+173$

$81+62+4346$

$101+112+2367$

subject $to$

$721+522+9ig45$

$x1>0$

$x20$

$x2>0$

Using the information below to write the initial simplex tableau. Be sure to name the top and sides with the appropriate variables.

Maximize $D=241+212+233$

$81+32+10354$

$91+52+7350$

subject $to$

$111+42+6359$

$x1>0$

$x20$

$x20$