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, \quad y \ge 0.\]
Solution: We are given: Objective function: \[Z = -5x + 3y\] Constraints: \[2x + y \le 10, \quad x + 3y \le 12, \quad x \ge 0, \quad y \ge 0.\] Step 1: Find intercepts for each boundary line. 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: Find the intersection of the two lines. From \(2x + y = 10\), we get \(y = 10 - 2x\). Substituting into \(x + 3y = 12\): \[x + 3(10 - 2x) = 12\] \[x + 30 - 6x = 12\] \[-5x = -18\] \[x = \frac{18}{5}\] Substituting back: \[y = 10 - 2 \cdot \frac{18}{5} = 10 - \frac{36}{5} = \frac{14}{5}\] So the intersection point is \(\left(\frac{18}{5},\ \frac{14}{5}\right)\). Step 3: Identify the corner points of the feasible region. The feasible region is bounded by the constraints and lies in the first quadrant. The corner points are: \(O = (0, 0)\), \(A = (5, 0)\), \(B = \left(\dfrac{18}{5}, \dfrac{14}{5}\right)\), and \(C = (0, 4)\). Step 4: Evaluate \(Z = -5x + 3y\) at each corner point. At \(O = (0, 0)\): \[Z = -5(0) + 3(0) = 0\] At \(A = (5, 0)\): \[Z = -5(5) + 3(0) = -25\] At \(B = \left(\dfrac{18}{5}, \dfrac{14}{5}\right)\): \[Z = -5 \cdot \frac{18}{5} + 3 \cdot \frac{14}{5} = -18 + \frac{42}{5} = \frac{-90 + 42}{5} = \frac{-48}{5} = -9.6\] At \(C = (0, 4)\): \[Z = -5(0) + 3(4) = 12\] Step 5: Compare values. The values of \(Z\) are \(0,\ -25,\ -9.6,\ 12\). The minimum value is \(-25\) at point \(A = (5, 0)\).
Answer: Minimum value of \(Z = -25\) at \((5,\ 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 10,\] \[x \ge 0, \quad y \ge 0.\]
Solution: We are given: Objective function: \[Z = -2x + 5y\] Constraints: \[x + y \le 6, \quad 2x + y \le 10, \quad x \ge 0, \quad y \ge 0.\] Step 1: Find intercepts for each boundary line. For \(x + y = 6\): when \(x = 0\), \(y = 6\); when \(y = 0\), \(x = 6\). Passes through \((0, 6)\) and \((6, 0)\). For \(2x + y = 10\): when \(x = 0\), \(y = 10\); when \(y = 0\), \(x = 5\). Passes through \((0, 10)\) and \((5, 0)\). Step 2: Find the intersection of the two lines. Subtract \(x + y = 6\) from \(2x + y = 10\): \[(2x + y) - (x + y) = 10 - 6\] \[x = 4\] Substituting \(x = 4\) into \(x + y = 6\): \[4 + y = 6 \Rightarrow y = 2\] So the intersection point is \((4, 2)\). Step 3: Identify the corner points of the feasible region. The feasible region lies in the first quadrant satisfying both constraints. Checking the origin \((0,0)\): both constraints satisfied. The corner points are: \(O = (0, 0)\), \(A = (5, 0)\), \(B = (4, 2)\), and \(C = (0, 6)\). Note: The point \((0,10)\) does not satisfy \(x + y \le 6\), so \(C = (0, 6)\) is the topmost feasible y-intercept. Step 4: Evaluate \(Z = -2x + 5y\) at each corner point. At \(O = (0, 0)\): \[Z = -2(0) + 5(0) = 0\] At \(A = (5, 0)\): \[Z = -2(5) + 5(0) = -10\] At \(B = (4, 2)\): \[Z = -2(4) + 5(2) = -8 + 10 = 2\] At \(C = (0, 6)\): \[Z = -2(0) + 5(6) = 30\] Step 5: Compare values. The values of \(Z\) are \(0,\ -10,\ 2,\ 30\). The minimum value is \(-10\) at point \(A = (5, 0)\).
Answer: Minimum value of \(Z = -10\) at \((5,\ 0)\).