SOLVER7 Study. Nothing Else.
2024 Board Paper Q30

Solve the following L.P.P. graphically:
\(\begin{align}\text{Maximise Z = x + 3y}\\ \text{Subject to constraints }\\ x + 2y \le 200\\ x + y\le150\\ y\le75\\ x,y\ge0\end{align}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you run a small shop and want to earn as much money as possible, but you only have limited supplies. You draw a picture of all the rules as lines on paper. The safe region where all rules are satisfied is like a fenced playground. The best earning happens at one of the corners of that fence. Here, checking each corner shows the biggest value of \( Z = x + 3y \) is \( 275 \), reached at the corner point \( (50, 75) \).

Answer: The maximum value is \( Z = 275 \), attained at the point \( (50, 75) \).

📖 Graphical Solution of an LPP: Maximising Z = x + 3y

Detailed Explanation

A Linear Programming Problem (LPP) asks us to maximise or minimise a linear objective function subject to a set of linear inequalities called constraints. In the graphical method, each inequality is plotted as a half-plane. The overlap of all these half-planes (including the non-negativity restrictions \( x \ge 0 \) and \( y \ge 0 \)) forms the feasible region. According to the Corner Point Theorem, the maximum or minimum value of the objective function \( Z \), if it exists, always occurs at a corner (vertex) of this feasible region. So we only need to evaluate \( Z \) at each corner point and compare the values.

Formula Used

Objective function: \( Z = x + 3y \). Corner Point Theorem: the optimal value of \( Z \) occurs at a vertex of the feasible region.

Solution

  1. Step 1: Write the constraints as boundary lines by replacing the inequality signs with equality. The lines are \( x + 2y = 200 \), \( x + y = 150 \), \( y = 75 \), together with the axes \( x = 0 \) and \( y = 0 \).
  2. Step 2: Find intercepts to plot each line. For \( x + 2y = 200 \): when \( x = 0, y = 100 \); when \( y = 0, x = 200 \). For \( x + y = 150 \): when \( x = 0, y = 150 \); when \( y = 0, x = 150 \). The line \( y = 75 \) is horizontal.
  3. Step 3: Decide the correct half-plane for each inequality using the test point \( (0,0) \). For \( x + 2y \le 200 \), \( 0 \le 200 \) is true, so keep the side containing the origin. For \( x + y \le 150 \), \( 0 \le 150 \) is true, so keep the origin side. For \( y \le 75 \), \( 0 \le 75 \) is true, so keep the origin side. Also \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
  4. Step 4: Find the corner points of the feasible region. Start at the origin \( O(0,0) \). Along the x-axis, \( x + y = 150 \) gives \( A(150, 0) \). Intersection of \( x + y = 150 \) and \( x + 2y = 200 \): subtracting gives \( y = 50 \) and \( x = 100 \), so \( B(100, 50) \). Intersection of \( x + 2y = 200 \) and \( y = 75 \): \( x + 150 = 200 \), so \( x = 50 \), giving \( C(50, 75) \). Along the y-axis, \( y = 75 \) gives \( D(0, 75) \).
  5. Step 5: The corner points of the feasible region are \( O(0,0),\ A(150,0),\ B(100,50),\ C(50,75),\ D(0,75) \). Evaluate \( Z = x + 3y \) at each: \( Z(O) = 0 + 0 = 0 \); \( Z(A) = 150 + 0 = 150 \); \( Z(B) = 100 + 150 = 250 \); \( Z(C) = 50 + 225 = 275 \); \( Z(D) = 0 + 225 = 225 \).
  6. Step 6: Compare the values of \( Z \). The largest value is \( 275 \), occurring at the corner point \( C(50, 75) \). Hence this is the point of maximum.

Final Answer

The maximum value is \( Z = 275 \), attained at the point \( (50, 75) \).

Common Mistake

A common mistake is choosing the wrong half-plane for an inequality (for example shading the side away from the origin for \( x + 2y \le 200 \)). Always test the point \( (0,0) \) in the original inequality: if it satisfies the inequality, shade the side that contains the origin.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Rewrite each inequality as an equation to identify boundary lines. The five boundaries are \( x + 2y = 200 \), \( x + y = 150 \), \( y = 75 \), \( x = 0 \), and \( y = 0 \). — Reason: Plotting boundary lines first lets us sketch the edges of every half-plane defined by the constraints.
  2. Step 2: Find two intercepts for each slanted line to draw it accurately. For \( x + 2y = 200 \): setting \( x = 0 \) gives \( y = 100 \), and setting \( y = 0 \) gives \( x = 200 \). For \( x + y = 150 \): setting \( x = 0 \) gives \( y = 150 \), and setting \( y = 0 \) gives \( x = 150 \). The line \( y = 75 \) is horizontal. — Reason: Two distinct points uniquely determine a straight line, so intercepts are the quickest way to plot it.
  3. Step 3: Determine which side of each boundary line belongs to the feasible region by testing the origin \( (0, 0) \). For \( x + 2y \le 200 \): substituting gives \( 0 \le 200 \), which is true, so the origin side is kept. For \( x + y \le 150 \): substituting gives \( 0 \le 150 \), which is true, so the origin side is kept. For \( y \le 75 \): substituting gives \( 0 \le 75 \), which is true, so again the origin side is kept. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is the area satisfying all five conditions simultaneously. — Reason: The feasible region is the intersection of all half-planes, and the origin test quickly tells us which half-plane each inequality represents.
  4. Step 4: Identify the corner (vertex) points of the feasible region. The vertices occur where boundary lines intersect. Solving \( x + y = 150 \) and \( y = 75 \) simultaneously: substituting \( y = 75 \) into \( x + y = 150 \) gives \( x = 75 \), so one vertex is \( (75, 75) \). Solving \( x + 2y = 200 \) and \( y = 75 \): substituting gives \( x + 150 = 200 \), so \( x = 50 \), giving vertex \( (50, 75) \). Solving \( x + 2y = 200 \) and \( x + y = 150 \): subtracting the second from the first gives \( y = 50 \) and then \( x = 100 \), giving vertex \( (100, 50) \). The remaining vertices on the axes are \( (0, 0) \), \( (150, 0) \), and \( (0, 75) \). — Reason: By the Corner Point Theorem, the optimum can only occur at vertices, so we must find all of them.
  5. Step 5: Evaluate \( Z = x + 3y \) at every corner point. At \( (0, 0) \): \( Z = 0 + 0 = 0 \). At \( (150, 0) \): \( Z = 150 + 0 = 150 \). At \( (100, 50) \): \( Z = 100 + 150 = 250 \). At \( (75, 75) \): \( Z = 75 + 225 = 300 \). Wait — \( (75, 75) \) must be checked against all constraints: \( x + 2y = 75 + 150 = 225 \le 200 \) is FALSE, so \( (75, 75) \) lies outside the feasible region and is discarded. At \( (50, 75) \): \( Z = 50 + 225 = 275 \). At \( (0, 75) \): \( Z = 0 + 225 = 225 \). — Reason: Substituting each vertex into the objective function and verifying feasibility ensures we compare only valid candidate points.
  6. Step 6: Compare all valid \( Z \)-values: \( 0,\; 150,\; 250,\; 275,\; 225 \). The largest value is \( Z = 275 \), occurring at the vertex \( (50, 75) \). — Reason: The Corner Point Theorem guarantees the global maximum is among these values, so the largest one is the answer.

Final Answer

The maximum value is \( Z = 275 \), attained at the point \( (50, 75) \).

Common Mistake

One common mistake: students sometimes include intersection points of boundary lines without checking whether those points actually satisfy ALL the constraints — a vertex that lies outside even one half-plane is not part of the feasible region and must be discarded before evaluating the objective function.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Identify Corner Points of Feasible Region: Boundary lines: \( x + 2y = 200 \), \( x + y = 150 \), \( y = 75 \), \( x = 0 \), \( y = 0 \). Solving \( x + y = 150 \) and \( y = 75 \) gives \( (75, 75) \). Solving \( x + 2y = 200 \) and \( y = 75 \) gives \( (50, 75) \). Solving \( x + 2y = 200 \) and \( x + y = 150 \) gives \( (100, 50) \). Corner points: \( (0, 0) \), \( (150, 0) \), \( (100, 50) \), \( (50, 75) \), \( (0, 75) \).
  2. Step 2: Evaluate \( Z = x + 3y \) at Each Corner Point: At \( (0, 0) \): \( Z = 0 \). At \( (150, 0) \): \( Z = 150 \). At \( (100, 50) \): \( Z = 100 + 150 = 250 \). At \( (50, 75) \): \( Z = 50 + 225 = 275 \). At \( (0, 75) \): \( Z = 0 + 225 = 225 \).
  3. Step 3: Identify Maximum: Maximum value \( Z = 275 \) occurs at \( (50, 75) \).

Answer: The maximum value is \( Z = 275 \), attained at the point \( (50, 75) \).

➕ More Examples

More Examples

Example 1

Question: Solve the following LPP graphically: Maximise \( Z = 2x + 5y \) subject to the constraints \( x + 2y \le 120 \), \( x + y \le 80 \), \( y \le 45 \), \( x, y \ge 0 \).

Solution: We need to maximise \( Z = 2x + 5y \) subject to the given constraints. Step 1 — Draw the boundary lines: Line 1: \( x + 2y = 120 \) passes through \( (120, 0) \) and \( (0, 60) \). Line 2: \( x + y = 80 \) passes through \( (80, 0) \) and \( (0, 80) \). Line 3: \( y = 45 \) is a horizontal line. Step 2 — Identify the feasible region satisfying all constraints including \( x \ge 0 \) and \( y \ge 0 \). Step 3 — Find the corner points: Corner A: \( (0, 0) \) (origin, satisfies all constraints). Corner B: Intersection of \( x + 2y = 120 \) with \( x = 0 \): gives \( (0, 60) \). Check \( x + y = 0 + 60 = 60 \le 80 \) ✓ and \( y = 60 > 45 \) ✗. So \( (0, 60) \) is NOT in the feasible region. Corner B (revised): Intersection of \( y = 45 \) with \( x = 0 \): gives \( (0, 45) \). Check \( x + 2y = 90 \le 120 \) ✓ and \( x + y = 45 \le 80 \) ✓. So \( (0, 45) \) is a corner. Corner C: Intersection of \( y = 45 \) with \( x + 2y = 120 \): Substituting \( y = 45 \): \( x + 90 = 120 \) so \( x = 30 \). Check \( x + y = 75 \le 80 \) ✓. Corner is \( (30, 45) \). Corner D: Intersection of \( x + y = 80 \) with \( x + 2y = 120 \): Subtracting, \( y = 40 \) and \( x = 40 \). Check \( y = 40 \le 45 \) ✓. Corner is \( (40, 40) \). Corner E: Intersection of \( x + y = 80 \) with \( y = 0 \): gives \( (80, 0) \). Check \( x + 2y = 80 \le 120 \) ✓. Corner is \( (80, 0) \). So the corner points are: \( (0,0) \), \( (80,0) \), \( (40,40) \), \( (30,45) \), \( (0,45) \). Step 4 — Evaluate \( Z = 2x + 5y \) at each corner: At \( (0, 0) \): \( Z = 0 \). At \( (80, 0) \): \( Z = 2(80) + 5(0) = 160 \). At \( (40, 40) \): \( Z = 2(40) + 5(40) = 80 + 200 = 280 \). At \( (30, 45) \): \( Z = 2(30) + 5(45) = 60 + 225 = 285 \). At \( (0, 45) \): \( Z = 2(0) + 5(45) = 225 \). The maximum value of \( Z \) is \( 285 \) at the point \( (30, 45) \).

Answer: Maximum \( Z = 285 \) at \( x = 30 \), \( y = 45 \).

Example 2

Question: A manufacturer produces two products P and Q. Each unit of P requires 3 hours on machine A and 1 hour on machine B. Each unit of Q requires 1 hour on machine A and 2 hours on machine B. Machine A is available for at most 120 hours and machine B for at most 80 hours. If the profit on each unit of P is Rs 4 and on each unit of Q is Rs 6, formulate and solve the LPP graphically to maximise profit. Also, the number of units of Q produced cannot exceed 35.

Solution: Let \( x \) = number of units of P produced and \( y \) = number of units of Q produced. Objective function: Maximise \( Z = 4x + 6y \). Constraints: \[ 3x + y \le 120 \] \[ x + 2y \le 80 \] \[ y \le 35 \] \[ x, y \ge 0 \] Step 1 — Draw boundary lines: Line 1: \( 3x + y = 120 \) passes through \( (40, 0) \) and \( (0, 120) \). Line 2: \( x + 2y = 80 \) passes through \( (80, 0) \) and \( (0, 40) \). Line 3: \( y = 35 \) is a horizontal line. Step 2 — Find the corner points of the feasible region: Corner A: \( (0, 0) \). Corner B: Intersection of \( 3x + y = 120 \) with \( y = 0 \): \( x = 40 \). Corner is \( (40, 0) \). Check \( x + 2y = 40 \le 80 \) ✓. Corner C: Intersection of \( 3x + y = 120 \) with \( x + 2y = 80 \): From Line 2: \( x = 80 - 2y \). Substituting into Line 1: \( 3(80 - 2y) + y = 120 \) gives \( 240 - 6y + y = 120 \) so \( 5y = 120 \) giving \( y = 24 \) and \( x = 80 - 48 = 32 \). Check \( y = 24 \le 35 \) ✓. Corner is \( (32, 24) \). Corner D: Intersection of \( x + 2y = 80 \) with \( y = 35 \): \( x + 70 = 80 \) so \( x = 10 \). Check \( 3(10) + 35 = 65 \le 120 \) ✓. Corner is \( (10, 35) \). Corner E: Intersection of \( y = 35 \) with \( x = 0 \): gives \( (0, 35) \). Check \( x + 2y = 70 \le 80 \) ✓ and \( 3x + y = 35 \le 120 \) ✓. So the corner points are: \( (0,0) \), \( (40,0) \), \( (32,24) \), \( (10,35) \), \( (0,35) \). Step 3 — Evaluate \( Z = 4x + 6y \) at each corner: At \( (0, 0) \): \( Z = 0 \). At \( (40, 0) \): \( Z = 4(40) + 6(0) = 160 \). At \( (32, 24) \): \( Z = 4(32) + 6(24) = 128 + 144 = 272 \). At \( (10, 35) \): \( Z = 4(10) + 6(35) = 40 + 210 = 250 \). At \( (0, 35) \): \( Z = 4(0) + 6(35) = 210 \). The maximum value of \( Z \) is \( 272 \) at the point \( (32, 24) \), i.e., produce 32 units of P and 24 units of Q for maximum profit of Rs 272.

Answer: Maximum profit \( Z = \text{Rs } 272 \) at \( x = 32 \) units of P and \( y = 24 \) units of Q.

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following L.P.P. graphically: Maximise \( Z = 2x + 5y \) subject to the constraints \( x + 2y \le 120 \), \( x + y \le 80 \), \( y \le 50 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: Identify the Constraints and Draw the Feasible Region: The constraints are: \( x + 2y \le 120 \) ... (i) \( x + y \le 80 \) ... (ii) \( y \le 50 \) ... (iii) \( x \ge 0,\; y \ge 0 \) Convert each inequality to an equation and find intercepts: For (i): \( x + 2y = 120 \) gives points \( (120,\, 0) \) and \( (0,\, 60) \). For (ii): \( x + y = 80 \) gives points \( (80,\, 0) \) and \( (0,\, 80) \). For (iii): \( y = 50 \) is a horizontal line. The feasible region is the set of all points satisfying all constraints simultaneously, lying in the first quadrant.
  2. Step 2: Find the Corner Points of the Feasible Region: Corner Point A — Intersection of \( x + 2y = 120 \) and \( y = 50 \): Substituting \( y = 50 \) into \( x + 2(50) = 120 \): \[ x = 120 - 100 = 20 \] So A \( = (20,\, 50) \). Corner Point B — Intersection of \( x + y = 80 \) and \( y = 50 \): Substituting \( y = 50 \) into \( x + 50 = 80 \): \[ x = 30 \] So B \( = (30,\, 50) \). Check whether B satisfies constraint (i): \( 30 + 2(50) = 130 > 120 \). B does NOT satisfy constraint (i), so it is outside the feasible region. Corner Point C — Intersection of \( x + 2y = 120 \) and \( x + y = 80 \): Subtracting the second from the first: \[ (x + 2y) - (x + y) = 120 - 80 \Rightarrow y = 40 \] Substituting back: \( x + 40 = 80 \Rightarrow x = 40 \). So C \( = (40,\, 40) \). Check constraint (iii): \( y = 40 \le 50 \). C is feasible. The corner points of the feasible region are: \( O = (0,\, 0) \), \( D = (80,\, 0) \), C \( = (40,\, 40) \), A \( = (20,\, 50) \), and \( E = (0,\, 50) \). Note: \( D = (80,\, 0) \) — check constraint (i): \( 80 + 0 = 80 \le 120 \). Feasible. \( E = (0,\, 50) \) — check constraint (ii): \( 0 + 50 = 50 \le 80 \). Feasible. Check constraint (i): \( 0 + 100 = 100 \le 120 \). Feasible.
  3. Step 3: Evaluate the Objective Function at Each Corner Point: The objective function is \( Z = 2x + 5y \). At \( O = (0,\, 0) \): \[ Z = 2(0) + 5(0) = 0 \] At \( D = (80,\, 0) \): \[ Z = 2(80) + 5(0) = 160 \] At \( C = (40,\, 40) \): \[ Z = 2(40) + 5(40) = 80 + 200 = 280 \] At \( A = (20,\, 50) \): \[ Z = 2(20) + 5(50) = 40 + 250 = 290 \] At \( E = (0,\, 50) \): \[ Z = 2(0) + 5(50) = 0 + 250 = 250 \]
  4. Step 4: Identify the Maximum Value: Comparing all values: \[ Z_O = 0,\quad Z_D = 160,\quad Z_C = 280,\quad Z_A = 290,\quad Z_E = 250 \] The maximum value of \( Z \) is \( 290 \), attained at the corner point \( A = (20,\, 50) \).

Answer: The maximum value of \( Z = 2x + 5y \) is \( Z = 290 \), attained at the point \( (20,\, 50) \).

Everything you get with Solver7

More questions in Linear Programming