3.II.20H

Optimization | Part IB, 2008

Use the simplex algorithm to solve the problem

maxx1+2x26x3\max x_{1}+2 x_{2}-6 x_{3}

subject to x1,x20,x35x_{1}, x_{2} \geqslant 0,\left|x_{3}\right| \leqslant 5, and

x1+x2+x372x2+x31\begin{array}{r} x_{1}+x_{2}+x_{3} \leqslant 7 \\ 2 x_{2}+x_{3} \geqslant 1 \end{array}

Typos? Please submit corrections to this page on GitHub.