SOLVER7 Study. Nothing Else.
Exercise 12.1 Q2

Solve the following Linear Programming Problems graphically: \( Minimise\ Z = – 3x + 4 y\)
subject to \(x + 2y \le 8, 3x + 2y \le 12, x \ge 0, y \ge 0.\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are choosing how many of two items to pick, but there are rules about how many you can take. The objective function \( Z = -3x + 4y \) is like a score — you want the lowest score possible. The constraints are like fences that keep you inside a safe zone. Every corner of that safe zone is a special point worth checking. The lowest score happens at the corner point \( (4, 0) \), giving a minimum value of \( -12 \).

Answer: The minimum value of \( Z \) is \( -12 \), attained at the corner point \( (4, 0) \).

📖 Minimising Z = -3x + 4y Graphically

Detailed Explanation

In Linear Programming, we optimise (maximise or minimise) a linear objective function subject to a set of linear inequalities called constraints. The set of all points satisfying every constraint is called the feasible region. A key result (the Corner Point Theorem) states that if the feasible region is bounded, the optimal value of the objective function occurs at one of the corner points (vertices) of the feasible region. So the strategy is: draw the boundary lines of each inequality, shade the region satisfying all constraints, identify the corner points, and then evaluate the objective function at each corner point. The smallest value gives the minimum.

Formula Used

Objective function: \( Z = -3x + 4y \). Evaluate \( Z \) at each corner point of the feasible region; the least value is the minimum.

Solution

  1. Step 1: Write down the problem. Minimise \( Z = -3x + 4y \) subject to the constraints \( x + 2y \le 8 \), \( 3x + 2y \le 12 \), \( x \ge 0 \), and \( y \ge 0 \). The last two constraints tell us we stay in the first quadrant.
  2. Step 2: Convert each inequality into an equation to draw the boundary lines. For \( x + 2y = 8 \): when \( x = 0 \), \( y = 4 \); when \( y = 0 \), \( x = 8 \). For \( 3x + 2y = 12 \): when \( x = 0 \), \( y = 6 \); when \( y = 0 \), \( x = 4 \).
  3. Step 3: Decide which side of each line to shade. Test the origin \( (0,0) \). For \( x + 2y \le 8 \): \( 0 \le 8 \) is true, so shade the side containing the origin. For \( 3x + 2y \le 12 \): \( 0 \le 12 \) is true, so again shade the origin side. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is a bounded region in the first quadrant.
  4. Step 4: Find the point of intersection of the two lines. Solve \( x + 2y = 8 \) and \( 3x + 2y = 12 \) together. Subtracting the first from the second: \[ (3x + 2y) - (x + 2y) = 12 - 8 \] \[ 2x = 4 \] \[ x = 2 \] Substitute \( x = 2 \) into \( x + 2y = 8 \): \[ 2 + 2y = 8 \] \[ y = 3 \] So the lines meet at \( (2, 3) \).
  5. Step 5: Identify the corner points of the feasible region. They are: the origin \( (0, 0) \), the point where \( 3x + 2y = 12 \) meets the x-axis \( (4, 0) \), the intersection point \( (2, 3) \), and the point where \( x + 2y = 8 \) meets the y-axis \( (0, 4) \).
  6. Step 6: Evaluate \( Z = -3x + 4y \) at each corner point. At \( (0,0) \): \[ Z = -3(0) + 4(0) = 0 \] At \( (4,0) \): \[ Z = -3(4) + 4(0) = -12 \] At \( (2,3) \): \[ Z = -3(2) + 4(3) = -6 + 12 = 6 \] At \( (0,4) \): \[ Z = -3(0) + 4(4) = 16 \]
  7. Step 7: Compare all values of \( Z \): \( 0, -12, 6, 16 \). The smallest value is \( -12 \), which occurs at the point \( (4, 0) \). Since the feasible region is bounded, this is the minimum value.

Final Answer

The minimum value of \( Z \) is \( -12 \), attained at the corner point \( (4, 0) \).

Common Mistake

A common mistake is forgetting that the objective has a negative coefficient. Students may focus only on the largest y-value or wrongly assume the minimum is at the origin. Always evaluate \( Z \) at every corner point and compare, because a negative coefficient can make a point far along the x-axis give the smallest value.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: State the problem clearly: We must minimise \( Z = -3x + 4y \) subject to \( x + 2y \le 8 \), \( 3x + 2y \le 12 \), \( x \ge 0 \), and \( y \ge 0 \). — Reason: Writing all constraints together helps us see the complete picture before we start drawing boundary lines.
  2. Step 2: Find intercepts of the boundary lines: For the line \( x + 2y = 8 \): set \( x = 0 \) to get \( y = 4 \), giving point \( (0, 4) \); set \( y = 0 \) to get \( x = 8 \), giving point \( (8, 0) \). For the line \( 3x + 2y = 12 \): set \( x = 0 \) to get \( y = 6 \), giving point \( (0, 6) \); set \( y = 0 \) to get \( x = 4 \), giving point \( (4, 0) \). — Reason: Two points are enough to draw a straight line, so intercepts are the quickest way to plot each boundary.
  3. Step 3: Identify the feasible region: Test the origin \( (0, 0) \) in each inequality. For \( x + 2y \le 8 \): substituting gives \( 0 \le 8 \), which is true, so the feasible side is the one containing the origin. For \( 3x + 2y \le 12 \): substituting gives \( 0 \le 12 \), also true, so again the feasible side contains the origin. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is the bounded area in the first quadrant below both lines. — Reason: The origin test is the fastest way to decide which half-plane to shade for each inequality.
  4. Step 4: Find the corner points of the feasible region: The corner points come from intersections of boundary lines and the axes. Corner A: intersection of \( x = 0 \) and \( y = 0 \) gives \( (0, 0) \). Corner B: intersection of \( 3x + 2y = 12 \) and \( y = 0 \) gives \( (4, 0) \). Corner C: intersection of \( x + 2y = 8 \) and \( 3x + 2y = 12 \) — subtract the first from the second to get \( 2x = 4 \), so \( x = 2 \); substituting back gives \( 2 + 2y = 8 \), so \( y = 3 \); corner is \( (2, 3) \). Corner D: intersection of \( x + 2y = 8 \) and \( x = 0 \) gives \( (0, 4) \). — Reason: The Corner Point Theorem guarantees the optimum lies at one of these vertices, so we must locate all of them precisely.
  5. Step 5: Evaluate Z at each corner point: At \( (0, 0) \): \( Z = -3(0) + 4(0) = 0 \). At \( (4, 0) \): \( Z = -3(4) + 4(0) = -12 \). At \( (2, 3) \): \( Z = -3(2) + 4(3) = -6 + 12 = 6 \). At \( (0, 4) \): \( Z = -3(0) + 4(4) = 16 \). — Reason: By the Corner Point Theorem, the true minimum of Z over the bounded feasible region must equal one of these computed values.
  6. Step 6: Select the minimum value: Comparing all values: \( Z = 0 \) at \( (0,0) \), \( Z = -12 \) at \( (4,0) \), \( Z = 6 \) at \( (2,3) \), and \( Z = 16 \) at \( (0,4) \). The smallest value is \( -12 \), occurring at \( (4, 0) \). — Reason: We compare all corner-point values to pick the least, since the minimum of a linear function on a bounded polygon must occur at a vertex.

Final Answer

The minimum value of \( Z \) is \( -12 \), attained at the corner point \( (4, 0) \).

Common Mistake

One common mistake: students forget to check all four corner points and only evaluate Z at the intersection of the two non-axis boundary lines, missing the vertex \( (4, 0) \) where the actual minimum occurs.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points of feasible region: \( (0,0) \), \( (4,0) \), \( (2,3) \), \( (0,4) \). (Intersection of \( x + 2y = 8 \) and \( 3x + 2y = 12 \) gives \( x = 2,\, y = 3 \).)
  2. Step 2: Evaluate \( Z = -3x + 4y \) at each corner: \( Z(0,0) = 0 \), \( Z(4,0) = -12 \), \( Z(2,3) = 6 \), \( Z(0,4) = 16 \).
  3. Step 3: Minimum value: \( Z = -12 \) at \( (4, 0) \).

Answer: The minimum value of \( Z \) is \( -12 \), attained at the corner point \( (4, 0) \).

➕ More Examples

More Examples

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\).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following Linear Programming Problem graphically: Minimise \( Z = -5x + 3y \) subject to the constraints \( x + y \le 6 \), \( 2x + y \le 10 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: Identify the Constraints and Plot the Boundary Lines: The constraints are: \( x + y \le 6 \), \( 2x + y \le 10 \), \( x \ge 0 \), \( y \ge 0 \). For line \( L_1 \): \( x + y = 6 \). When \( x = 0 \), \( y = 6 \); when \( y = 0 \), \( x = 6 \). Points: \( (0, 6) \) and \( (6, 0) \). For line \( L_2 \): \( 2x + y = 10 \). When \( x = 0 \), \( y = 10 \); when \( y = 0 \), \( x = 5 \). Points: \( (0, 10) \) and \( (5, 0) \).
  2. Step 2: Find the Intersection of the Two Boundary Lines: Solve \( x + y = 6 \) and \( 2x + y = 10 \) simultaneously. Subtracting the first equation from the second: \( (2x + y) - (x + y) = 10 - 6 \), which gives \( x = 4 \). Substituting \( x = 4 \) into \( x + y = 6 \): \( 4 + y = 6 \), so \( y = 2 \). The intersection point is \( (4, 2) \).
  3. Step 3: Determine the Feasible Region and Corner Points: Since both inequalities use \( \le \) and \( x \ge 0 \), \( y \ge 0 \), the feasible region lies in the first quadrant, below (or on) both lines. The corner points of the feasible region are: \( A = (0, 0) \), \( B = (5, 0) \), \( C = (4, 2) \), and \( D = (0, 6) \).
  4. Step 4: Evaluate the Objective Function at Each Corner Point: Objective function: \( Z = -5x + 3y \). At \( A = (0, 0) \): \( Z = -5(0) + 3(0) = 0 \). At \( B = (5, 0) \): \( Z = -5(5) + 3(0) = -25 \). At \( C = (4, 2) \): \( Z = -5(4) + 3(2) = -20 + 6 = -14 \). At \( D = (0, 6) \): \( Z = -5(0) + 3(6) = 18 \).
  5. Step 5: Identify the Minimum Value: Comparing the values: \( Z(A) = 0 \), \( Z(B) = -25 \), \( Z(C) = -14 \), \( Z(D) = 18 \). The minimum value is \( Z = -25 \), which occurs at the corner point \( B = (5, 0) \).

Answer: The minimum value of \( Z \) is \( -25 \), attained at the corner point \( (5, 0) \).

Everything you get with Solver7

More questions in Linear Programming