Solve the following Linear Programming Problems graphically: \(Minimise\ Z = 3x + 5y\)
such that \(x + 3y \ge 3, x + y \ge 2, x, y \ge 0.\)
CBSE Class 12 Maths · Linear Programming
CBSE Class 12 Maths · Linear Programming
Imagine you want to spend the least amount of money buying two items at a shop. Some rules say you must buy at least a certain amount of each. You try every corner of the allowed shopping region to find the cheapest total. The smallest total you can reach while still following all the rules is your answer. Here, the cheapest total is \( Z = 7 \), found by buying \( \tfrac{3}{2} \) of one item and \( \tfrac{1}{2} \) of the other.
Answer: The minimum value is \( Z = 7 \), attained at the point \( \left(\tfrac{3}{2}, \tfrac{1}{2}\right) \).
In Linear Programming, we optimise (minimise or maximise) a linear objective function subject to linear constraints. The set of all points satisfying every constraint is called the feasible region. According to the Corner Point Theorem, the optimum value of the objective function, if it exists, occurs at a corner (vertex) of the feasible region. When the feasible region is unbounded (it extends infinitely), a minimum may still exist, but we must verify it. For a minimum value \( m \) obtained at a corner point, we check whether the open half-plane \( 3x + 5y < m \) has any point in common with the feasible region. If it has no common point, then \( m \) is indeed the minimum.
Objective function: \( Z = 3x + 5y \). Evaluate \( Z \) at every corner point of the feasible region; the smallest value is the minimum (verified for unbounded regions).
The minimum value is \( Z = 7 \), attained at the point \( \left(\tfrac{3}{2}, \tfrac{1}{2}\right) \).
A common mistake is to assume the smallest corner value is automatically the minimum for an unbounded region without verifying it. You must check that the open half-plane \( 3x + 5y < 7 \) has no point in common with the feasible region; only then can you confirm the minimum exists.
The minimum value is \( Z = 7 \), attained at the point \( \left(\tfrac{3}{2}, \tfrac{1}{2}\right) \).
One common mistake: Students forget to verify the minimum for an unbounded feasible region — they assume the smallest corner-point value is automatically the global minimum without checking whether the open half-plane \( 3x + 5y < m \) has any intersection with the feasible region, which can lead to an incorrect answer.
Answer: The minimum value is \( Z = 7 \), attained at the point \( \left(\tfrac{3}{2}, \tfrac{1}{2}\right) \).
Question: Solve the following Linear Programming Problem graphically: Minimise \(Z = 4x + 6y\) subject to the constraints \(2x + y \ge 4\), \(x + 2y \ge 4\), \(x \ge 0\), \(y \ge 0\).
Solution: Step 1: Identify the boundary lines from the constraints. Line 1: \(2x + y = 4\). When \(x = 0\), \(y = 4\); when \(y = 0\), \(x = 2\). Line 2: \(x + 2y = 4\). When \(x = 0\), \(y = 2\); when \(y = 0\), \(x = 4\). Step 2: Determine the feasible region. Since both constraints use \(\ge\), the feasible region lies above (or on) each line and in the first quadrant (\(x \ge 0\), \(y \ge 0\)). Step 3: Find the corner points of the feasible region. Corner A — intersection of \(2x + y = 4\) with the \(y\)-axis: Setting \(x = 0\) gives \(y = 4\), so \(A = (0, 4)\). Corner B — intersection of \(x + 2y = 4\) with the \(x\)-axis: Setting \(y = 0\) gives \(x = 4\), so \(B = (4, 0)\). Corner C — intersection of lines 1 and 2: Solving \(2x + y = 4\) and \(x + 2y = 4\) simultaneously: From Line 1: \(y = 4 - 2x\). Substituting into Line 2: \[x + 2(4 - 2x) = 4\] \[x + 8 - 4x = 4\] \[-3x = -4\] \[x = \frac{4}{3}\] Then \(y = 4 - 2 \times \dfrac{4}{3} = 4 - \dfrac{8}{3} = \dfrac{4}{3}\). So \(C = \left(\dfrac{4}{3},\, \dfrac{4}{3}\right)\). Step 4: Evaluate \(Z = 4x + 6y\) at each corner. At \(A = (0, 4)\): \(Z = 4(0) + 6(4) = 24\). At \(B = (4, 0)\): \(Z = 4(4) + 6(0) = 16\). At \(C = \left(\dfrac{4}{3}, \dfrac{4}{3}\right)\): \[Z = 4 \times \frac{4}{3} + 6 \times \frac{4}{3} = \frac{16}{3} + \frac{24}{3} = \frac{40}{3} \approx 13.33\] Step 5: The minimum value of \(Z\) is \(\dfrac{40}{3}\), attained at \(\left(\dfrac{4}{3},\, \dfrac{4}{3}\right)\).
Answer: Minimum value of \(Z = \dfrac{40}{3}\) at \(x = \dfrac{4}{3}\), \(y = \dfrac{4}{3}\).
Question: Solve the following Linear Programming Problem graphically: Minimise \(Z = 5x + 4y\) subject to the constraints \(x + y \ge 5\), \(2x + y \ge 6\), \(x \ge 0\), \(y \ge 0\).
Solution: Step 1: Identify the boundary lines. Line 1: \(x + y = 5\). When \(x = 0\), \(y = 5\); when \(y = 0\), \(x = 5\). Line 2: \(2x + y = 6\). When \(x = 0\), \(y = 6\); when \(y = 0\), \(x = 3\). Step 2: Feasible region. Both constraints use \(\ge\), so the feasible region is above (or on) each boundary line in the first quadrant. Step 3: Find the corner points. Corner A — Line 1 meets the \(y\)-axis: \(x = 0\) gives \(y = 5\), so \(A = (0, 5)\). We also check whether Line 2 meets the \(y\)-axis at a higher point: \(x = 0\) gives \(y = 6\). Since \(6 > 5\), the point \((0, 6)\) satisfies \(x + y \ge 5\) as well, so the actual upper corner on the \(y\)-axis is \((0, 6)\). Let us recheck. On the \(y\)-axis (\(x = 0\)): Line 1 requires \(y \ge 5\) and Line 2 requires \(y \ge 6\). So the binding constraint is Line 2, giving corner \(A = (0, 6)\). Corner B — Line 1 meets the \(x\)-axis: \(y = 0\) gives \(x = 5\). Check Line 2: \(2(5) + 0 = 10 \ge 6\). So \(B = (5, 0)\) is feasible. Corner C — intersection of Line 1 and Line 2: Subtract Line 1 from Line 2: \[(2x + y) - (x + y) = 6 - 5\] \[x = 1\] Substituting \(x = 1\) into Line 1: \(1 + y = 5\), so \(y = 4\). Thus \(C = (1, 4)\). Step 4: Evaluate \(Z = 5x + 4y\) at each corner. At \(A = (0, 6)\): \(Z = 5(0) + 4(6) = 24\). At \(B = (5, 0)\): \(Z = 5(5) + 4(0) = 25\). At \(C = (1, 4)\): \[Z = 5(1) + 4(4) = 5 + 16 = 21\] Step 5: The minimum value of \(Z\) is \(21\), attained at \((1, 4)\).
Answer: Minimum value of \(Z = 21\) at \(x = 1\), \(y = 4\).
Question: Solve the following Linear Programming Problem graphically: Minimise \( Z = 5x + 2y \) subject to the constraints \( x + 2y \ge 4 \), \( 2x + y \ge 4 \), \( x \ge 0 \), \( y \ge 0 \).
Answer: The minimum value of \( Z = 5x + 2y \) is \( 8 \), attained at the corner point \( (0,\, 4) \).