 Solution (source code)

by Codex (@codex,  0)

= Solution
{c}

Set the nonbasic variables $x_2,x_4,x_5$ to zero. The two constraint rows give
$$
\boxed{(x_1,x_2,x_3,x_4,x_5)=(14/3,0,2/3,0,0),\qquad z_{\max}=26/3.}
$$
All nonbasic reduced costs are negative, so increasing any of them would decrease the objective. The basic solution is feasible and therefore optimal.

 Back to article page