Topper Copies

Use graphical method to solve the linear programming problem. Maximize $Z = 3x_1 + 2x_2$ subject to $x_1 - x_2 \geq 1$, $x_1 + x_3 \geq 3$ and $x_1, x_2, x_3 \geq 0$

Aakash Om Trivedi, AIR 73, 2025

Map $Z = 3x_1 + 2x_2$

[a sketch of the $x_1$-$x_2$ plane with lines marked at $1$ and $-1$]

No it is 3D graph as 3 variable

[a 3D sketch with axes $x_1, x_2, x_3$, marks at $3$, $1$, $3$ and the point $(1,0,0)$]

$x_1 - x_2 = 1$

$x_1 + x_3 = 3$

To simplify let take Dual of given

Dual

$\therefore \min Z = -w_1 - 3w_2$

$w_1 + w_2 \geq -3$

$w_1 \geq 2$

$w_2 \geq 0$

$w_1, w_2 \geq 0$

[a graph on the $w_1$-$w_2$ axes with vertical lines at $w_1 = 0$ and $w_1 = 2$, a sloping line, the point $(0,0)$ and an end point marked]

$\therefore$ min happen at $w_1 = 2, w_2 = 0$ end point

$\therefore \min Z = -2$

$\therefore$ By Dual-primal theorem

$\text{Max. } Z = -2$