Topper Copies

Solve the following programming problem by graphical method; Max. $Z = 5x_1 + 7x_2,$ s.t $x_1 + x_2 \leq 4$ $3x_1 + 8x_2 \leq 24$ $10x_1 + 7x_2 \leq 35$ and $x_1, x_2 \geq 0$

Aryan Yadav, AIR 31, 2025

Finding the points of intersection,

$x_1 + x_2 = 4$ , $3x_1 + 8x_2 = 24$

$\Rightarrow (1.6, 2.4)$

$x_1 + x_2 = 4$, $10x_1 + 7x_2 = 35$

$\Rightarrow (\frac{7}{3}, \frac{5}{3})$

$3x_1 + 8x_2 = 24$, $10x_1 + 7x_2 = 35$

$\Rightarrow (\frac{112}{59}, \frac{135}{59})$

[a graph on axes $x_1$ and $x_2$ with the lines $x_1 + x_2 = 4$, $3x_1 + 8x_2 = 24$ and $10x_1 + 7x_2 = 35$, the feasible region near the origin hatched, with points A, B, C, D marked]

Vertex points $O = (0,0)$, $A = (0,3)$, $B = (\frac{7}{2}, 0)$, $C = (\frac{7}{3}, \frac{5}{3})$, $D = (1.6, 2.4)$

$Z(0,0) = 0$ , $Z(0,3) = 21$

$Z(\frac{7}{2}, 0) = \frac{35}{2}$ , $Z(\frac{7}{3}, \frac{5}{3}) = \frac{70}{3}$

$Z(1.6, 2.4) = 24.8$

Max $= 24.8$ at $x_1 = 1.6$, $x_2 = 2.4$