Example 1
Question: Solve the following Linear Programming Problem graphically: Minimise \(Z = -5x + 3y\) subject to the constraints \(2x + y \le 10\), \(x + 3y \le 12\), \(x \ge 0\), \(y \ge 0\).
Solution: We need to minimise \(Z = -5x + 3y\) subject to \(2x + y \le 10\), \(x + 3y \le 12\), \(x \ge 0\), \(y \ge 0\). Step 1: Find boundary lines and their intercepts. For \(2x + y = 10\): when \(x = 0\), \(y = 10\); when \(y = 0\), \(x = 5\). So the line passes through \((0, 10)\) and \((5, 0)\). For \(x + 3y = 12\): when \(x = 0\), \(y = 4\); when \(y = 0\), \(x = 12\). So the line passes through \((0, 4)\) and \((12, 0)\). Step 2: Identify the feasible region. Both constraints require the region on or below (towards the origin) each line, combined with \(x \ge 0\) and \(y \ge 0\) (first quadrant). Step 3: Find the corner points. Corner A: intersection of \(x = 0\) and \(x + 3y = 12\) gives \(y = 4\), so \(A = (0, 4)\). Corner B: intersection of \(2x + y = 10\) and \(x + 3y = 12\). From the first equation, \(y = 10 - 2x\). Substituting into the second: \[x + 3(10 - 2x) = 12\] \[x + 30 - 6x = 12\] \[-5x = -18\] \[x = \frac{18}{5}\] Then \(y = 10 - 2 \times \dfrac{18}{5} = 10 - \dfrac{36}{5} = \dfrac{14}{5}\). So \(B = \left(\dfrac{18}{5},\ \dfrac{14}{5}\right)\). Corner C: intersection of \(2x + y = 10\) and \(y = 0\) gives \(x = 5\), so \(C = (5, 0)\). Corner D: intersection of \(x = 0\) and \(y = 0\) gives \(D = (0, 0)\). Step 4: Evaluate \(Z = -5x + 3y\) at each corner point. At \(D = (0, 0)\): \(Z = -5(0) + 3(0) = 0\). At \(A = (0, 4)\): \(Z = -5(0) + 3(4) = 12\). At \(B = \left(\dfrac{18}{5}, \dfrac{14}{5}\right)\): \(Z = -5 \times \dfrac{18}{5} + 3 \times \dfrac{14}{5} = -18 + \dfrac{42}{5} = -18 + 8.4 = -9.6 = -\dfrac{48}{5}\). At \(C = (5, 0)\): \(Z = -5(5) + 3(0) = -25\). Step 5: Compare all values: \(Z(D) = 0\), \(Z(A) = 12\), \(Z(B) = -\dfrac{48}{5}\), \(Z(C) = -25\). The minimum value of \(Z\) is \(-25\), attained at \((5, 0)\).
Answer: Minimum \(Z = -25\) at \(x = 5,\ y = 0\).
Example 2
Question: Solve the following Linear Programming Problem graphically: Minimise \(Z = -2x + 5y\) subject to the constraints \(x + y \le 6\), \(2x + y \le 8\), \(x \ge 0\), \(y \ge 0\).
Solution: We need to minimise \(Z = -2x + 5y\) subject to \(x + y \le 6\), \(2x + y \le 8\), \(x \ge 0\), \(y \ge 0\). Step 1: Find boundary lines and their intercepts. For \(x + y = 6\): passes through \((0, 6)\) and \((6, 0)\). For \(2x + y = 8\): passes through \((0, 8)\) and \((4, 0)\). Step 2: The feasible region is on or below both lines, in the first quadrant. Step 3: Find corner points. Corner O: \((0, 0)\) (origin). Corner A: intersection of \(x = 0\) and \(x + y = 6\) gives \(A = (0, 6)\). But we must check whether \((0, 6)\) satisfies \(2x + y \le 8\): \(2(0) + 6 = 6 \le 8\). Yes, it is feasible. Corner B: intersection of \(x + y = 6\) and \(2x + y = 8\). Subtracting the first equation from the second: \[(2x + y) - (x + y) = 8 - 6\] \[x = 2\] Then \(y = 6 - 2 = 4\). So \(B = (2, 4)\). Corner C: intersection of \(2x + y = 8\) and \(y = 0\) gives \(x = 4\), so \(C = (4, 0)\). Check whether \((4, 0)\) satisfies \(x + y \le 6\): \(4 + 0 = 4 \le 6\). Yes, feasible. Step 4: Evaluate \(Z = -2x + 5y\) at each corner point. At \(O = (0, 0)\): \(Z = -2(0) + 5(0) = 0\). At \(A = (0, 6)\): \(Z = -2(0) + 5(6) = 30\). At \(B = (2, 4)\): \(Z = -2(2) + 5(4) = -4 + 20 = 16\). At \(C = (4, 0)\): \(Z = -2(4) + 5(0) = -8\). Step 5: Compare all values: \(Z(O) = 0\), \(Z(A) = 30\), \(Z(B) = 16\), \(Z(C) = -8\). The minimum value of \(Z\) is \(-8\), attained at \((4, 0)\).
Answer: Minimum \(Z = -8\) at \(x = 4,\ y = 0\).