SOLVER7 Study. Nothing Else.
2023 Board Paper Q30

Solve the following linear programming problem graphically :
\(\begin{aligned} \text{Minimise:} z= -3x + 4y \\ \text{subject to constraints}\\ x + 2y \le 8,\\ 3x+2y \le 12,\\ x, y \ge 0. \end{aligned}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are planning a picnic and want to spend as little money as possible. You have rules about how much food you can carry. The feasible region is like the allowed zone on a map. The corner points are the special spots where boundaries meet. We check the cost at each corner spot. The lowest cost wins! Here, the cheapest corner is the point \( (4, 0) \), giving a minimum value of \( -12 \). Always check corners, not random spots inside.

Answer: The minimum value of \( z = -3x + 4y \) is \( -12 \), attained at the corner point \( (4, 0) \).

📖 Minimising z = -3x + 4y Graphically

Detailed Explanation

In a Linear Programming Problem (LPP) we want to optimise (minimise or maximise) a linear objective function subject to a set of linear inequalities called constraints. The set of all points that satisfy every constraint is called the feasible region. A key result of the Corner Point Theorem states that the optimal value of the objective function (if it exists) always occurs at a vertex (corner point) of the feasible region. So the method is: draw all the constraint lines, shade the region satisfying all inequalities, find the coordinates of the corner points, and then evaluate the objective function \( z = -3x + 4y \) at each corner point. The smallest of these values gives the minimum.

Formula Used

Objective function: \( z = -3x + 4y \). Corner Point Theorem: the optimum of \( z \) over a bounded feasible region occurs at one of its corner points.

Solution

  1. Step 1: Write down the objective function and constraints. Minimise \( z = -3x + 4y \) subject to \( x + 2y \le 8 \), \( 3x + 2y \le 12 \), \( x \ge 0 \), and \( y \ge 0 \).
  2. Step 2: Convert each inequality into an equation to draw the boundary lines. Line 1: \( x + 2y = 8 \). Line 2: \( 3x + 2y = 12 \). The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
  3. Step 3: Find the intercepts to plot the 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 \). Plot these points and join them to draw the two lines.
  4. Step 4: 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. Together with the first quadrant, this gives a bounded feasible region.
  5. Step 5: Find the point of intersection of the two lines. Solve \( x + 2y = 8 \) and \( 3x + 2y = 12 \) simultaneously. Subtracting the first from the second gives \( 2x = 4 \), so \( x = 2 \). Substituting back into \( x + 2y = 8 \) gives \( 2 + 2y = 8 \), so \( 2y = 6 \) and \( y = 3 \). The intersection point is \( (2, 3) \).
  6. Step 6: List the corner points of the feasible region. These are \( O(0, 0) \), \( A(4, 0) \) (where line 2 meets the x-axis), \( B(2, 3) \) (intersection of the two lines), and \( C(0, 4) \) (where line 1 meets the y-axis).
  7. Step 7: Evaluate \( z = -3x + 4y \) at each corner point. At \( O(0,0) \): \( z = -3(0) + 4(0) = 0 \). At \( A(4,0) \): \( z = -3(4) + 4(0) = -12 \). At \( B(2,3) \): \( z = -3(2) + 4(3) = -6 + 12 = 6 \). At \( C(0,4) \): \( z = -3(0) + 4(4) = 16 \).
  8. Step 8: Compare all values of \( z \): \( 0, -12, 6, 16 \). The smallest value is \( -12 \), which occurs at the point \( A(4, 0) \). Since the feasible region is bounded, this minimum value is guaranteed.

Final Answer

The minimum value of \( z = -3x + 4y \) is \( -12 \), attained at the corner point \( (4, 0) \).

Common Mistake

A common mistake is to assume the minimum must occur at the origin because the objective is minimised. In fact, because of the negative coefficient of \( x \), moving away from the origin along the x-axis makes \( z \) smaller. Always evaluate \( z \) at every corner point rather than guessing.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write the boundary equations by replacing each inequality with an equality. Line 1: \( x + 2y = 8 \) and Line 2: \( 3x + 2y = 12 \). The non-negativity conditions \( x \ge 0 \) and \( y \ge 0 \) confine everything to the first quadrant. — Reason: Boundary lines define the edges of the feasible region, which we need to draw and identify corner points.
  2. Step 2: Find the axis intercepts of each line to plot them accurately. For \( 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 \( 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 uniquely determine a line, and intercepts are the easiest pair to compute.
  3. Step 3: Find the intersection point of the two boundary lines by solving them simultaneously. Subtract Line 1 from Line 2: \[ (3x + 2y) - (x + 2y) = 12 - 8 \] This simplifies to \( 2x = 4 \), so \( x = 2 \). Substitute \( x = 2 \) back into Line 1: \( 2 + 2y = 8 \), giving \( y = 3 \). The intersection point is \( (2, 3) \). — Reason: This interior intersection is one of the corner points of the feasible region.
  4. Step 4: Identify all four corner points of the feasible region by considering where the boundary lines meet each other and the axes within the first quadrant. The corner points are: \( (0, 0) \), \( (4, 0) \), \( (2, 3) \), and \( (0, 4) \). — Reason: The Corner Point Theorem requires us to evaluate \( z \) at every vertex; missing even one can lead to the wrong answer.
  5. Step 5: Evaluate the objective function \( 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 \). — Reason: Plugging each vertex into \( z \) lets us compare all candidate optimal values directly.
  6. Step 6: Compare all computed values of \( z \): the values are \( 0,\, -12,\, 6,\, 16 \). The smallest value is \( -12 \), which occurs at the corner point \( (4, 0) \). — Reason: Since the feasible region is bounded, the minimum must exist and equals the smallest value among those computed at the corner points.

Final Answer

The minimum value of \( z = -3x + 4y \) is \( -12 \), attained at the corner point \( (4, 0) \).

Common Mistake

One common mistake: students sometimes forget to check the origin \( (0, 0) \) as a corner point, or they misidentify the feasible region by shading the wrong side of a constraint line, leading to an incorrect set of vertices and a wrong minimum.

✍️ 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 is \( z = -12 \) at \( (4, 0) \).

Answer: The minimum value of \( z = -3x + 4y \) 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, \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)\).

🎯 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 and Plot the Constraints: The constraints are: \( x + y \le 6 \), \( 2x + y \le 10 \), \( x \ge 0 \), \( y \ge 0 \). For \( x + y = 6 \): when \( x = 0 \), \( y = 6 \); when \( y = 0 \), \( x = 6 \). So the line passes through \( (0, 6) \) and \( (6, 0) \). For \( 2x + y = 10 \): when \( x = 0 \), \( y = 10 \); when \( y = 0 \), \( x = 5 \). So the line passes through \( (0, 10) \) and \( (5, 0) \). Shade the region below both lines and in the first quadrant to form the feasible region.
  2. Step 2: Find the Corner Points of the Feasible Region: The corner points of the feasible region are found from the intersections of the boundary lines and the axes. Corner A: Intersection of \( x = 0 \) and \( y = 0 \) gives \( (0, 0) \). Corner B: Intersection of \( y = 0 \) and \( 2x + y = 10 \) gives \( (5, 0) \). Corner C: Intersection of \( x + y = 6 \) and \( 2x + y = 10 \). Subtracting the first from the second: \( x = 4 \), so \( y = 6 - 4 = 2 \). This gives \( (4, 2) \). Corner D: Intersection of \( x = 0 \) and \( x + y = 6 \) gives \( (0, 6) \).
  3. Step 3: Evaluate the Objective Function at Each Corner Point: Compute \( z = -5x + 3y \) at each corner point. At \( (0, 0) \): \[ z = -5(0) + 3(0) = 0 \] At \( (5, 0) \): \[ z = -5(5) + 3(0) = -25 \] At \( (4, 2) \): \[ z = -5(4) + 3(2) = -20 + 6 = -14 \] At \( (0, 6) \): \[ z = -5(0) + 3(6) = 18 \]
  4. Step 4: Identify the Minimum Value: Comparing all values: \( z = 0 \) at \( (0,0) \), \( z = -25 \) at \( (5, 0) \), \( z = -14 \) at \( (4, 2) \), and \( z = 18 \) at \( (0, 6) \). The minimum value is \( z = -25 \), attained at the corner point \( (5, 0) \).

Answer: The minimum value of \( z = -5x + 3y \) is \( -25 \), attained at the corner point \( (5, 0) \).

Everything you get with Solver7

More questions in Linear Programming