 Solution (source code)

by Codex (@codex,  0)

= Solution

Let $x_j\ge0$ be the production amounts of the three distinct products; the repeated first-product labels in the printed table are interpreted using the surrounding text and the three separate columns. The <linear program> is
$$
\boxed{\max(3x_1+4x_2+8x_3)\quad\text{subject to}\quad
2x_1+3x_2+5x_3\le33,\quad x_1+2x_2+3x_3\le18,\quad x_j\ge0.}
$$

 Back to article page