SOLVER7 Study. Nothing Else.
2024 Board Paper Q30

Solve the following linear programming problem graphically :
\(\begin{align}\text{Maximise z = 4x + 3y}\\ \text{Subject to constraints }\\ x + y \le 800\\ 2x + y \le 1000\\ x\le 400\\ x,y \ge 0.\ \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. You can only use limited supplies, so you cannot make unlimited products. The trick is to try every corner of your allowed choices, like checking each corner of a room for hidden treasure. Whichever corner gives the biggest earnings is your answer. Here, the best mix is making 200 units of one product and 600 of another, giving a total earning of 2600.

Answer: The maximum value is \( z = 2600 \), attained at \( x = 200 \) and \( y = 600 \), i.e. at the corner point \( B(200, 600) \).

📖 Graphical Solution of an LPP: Maximise z = 4x + 3y

Detailed Explanation

In Linear Programming, we want to maximise (or minimise) a linear objective function subject to linear inequality constraints. The set of all points satisfying every constraint is called the feasible region. When this region is bounded, the optimal value of the objective function always occurs at one of its corner (vertex) points. This is known as the Corner Point Method. So the strategy is: draw each constraint line, shade the region satisfying all inequalities, find the coordinates of all corner points, and finally compute the value of the objective function at each corner to pick the best one.

Formula Used

Objective function: \( z = 4x + 3y \). Corner Point Method: evaluate \( z \) at every vertex of the feasible region; the largest value is the maximum.

Solution

  1. Step 1: Write down the problem. Maximise \( z = 4x + 3y \) subject to \( x + y \le 800 \), \( 2x + y \le 1000 \), \( x \le 400 \), and \( x, y \ge 0 \). The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
  2. Step 2: Convert each inequality into a boundary line and find its intercepts. For \( x + y = 800 \), the intercepts are \( (800, 0) \) and \( (0, 800) \). For \( 2x + y = 1000 \), the intercepts are \( (500, 0) \) and \( (0, 1000) \). The line \( x = 400 \) is a vertical line.
  3. Step 3: Decide the correct side of each line using a test point, usually the origin \( (0,0) \). Checking \( x + y \le 800 \): \( 0 \le 800 \) is true, so shade the origin side. Checking \( 2x + y \le 1000 \): \( 0 \le 1000 \) is true, so again the origin side. For \( x \le 400 \): \( 0 \le 400 \) is true, so keep the left side. The feasible region is where all shaded areas overlap in the first quadrant.
  4. Step 4: Find the corner points of the feasible region. Origin: \( O(0, 0) \). On the y-axis, the tightest constraint gives \( A(0, 800) \). Intersection of \( x + y = 800 \) and \( 2x + y = 1000 \): subtracting gives \( x = 200 \), then \( y = 600 \), so \( B(200, 600) \). Intersection of \( 2x + y = 1000 \) and \( x = 400 \): \( y = 1000 - 800 = 200 \), so \( C(400, 200) \). Finally on the x-axis, \( x = 400 \) meets \( y = 0 \) at \( D(400, 0) \).
  5. Step 5: Verify each corner satisfies all constraints. At \( B(200,600) \): \( 200+600 = 800 \le 800 \) and \( 2(200)+600 = 1000 \le 1000 \) and \( 200 \le 400 \) — all valid. At \( C(400,200) \): \( 400+200 = 600 \le 800 \), \( 2(400)+200 = 1000 \le 1000 \), \( 400 \le 400 \) — all valid. The bounded feasible region has vertices \( O(0,0),\ A(0,800),\ B(200,600),\ C(400,200),\ D(400,0) \).
  6. Step 6: Evaluate \( z = 4x + 3y \) at each corner point. At \( O(0,0): z = 0 \). At \( A(0,800): z = 4(0)+3(800) = 2400 \). At \( B(200,600): z = 4(200)+3(600) = 800+1800 = 2600 \). At \( C(400,200): z = 4(400)+3(200) = 1600+600 = 2200 \). At \( D(400,0): z = 4(400)+3(0) = 1600 \).
  7. Step 7: Compare all values: \( 0,\ 2400,\ 2600,\ 2200,\ 1600 \). The greatest value is \( 2600 \), which occurs at the corner point \( B(200, 600) \).

Final Answer

The maximum value is \( z = 2600 \), attained at \( x = 200 \) and \( y = 600 \), i.e. at the corner point \( B(200, 600) \).

Common Mistake

A common mistake is forgetting to find the intersection point of two constraint lines (here \( B(200,600) \)) and only checking the axis intercepts. Since the maximum actually occurs at this intersection vertex, missing it leads to the wrong answer. Always compute every corner of the feasible region, including where two lines meet.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write out the complete problem. Maximise \( z = 4x + 3y \) subject to the constraints \( x + y \le 800 \), \( 2x + y \le 1000 \), \( x \le 400 \), and the non-negativity conditions \( x \ge 0 \), \( y \ge 0 \). — Reason: Listing every constraint clearly ensures we do not accidentally miss a boundary when drawing the feasible region.
  2. Step 2: Replace each inequality with its boundary line and read off the intercepts. For \( x + y = 800 \): intercepts are \( (800, 0) \) and \( (0, 800) \). For \( 2x + y = 1000 \): intercepts are \( (500, 0) \) and \( (0, 1000) \). For \( x = 400 \): a vertical line cutting the x-axis at \( (400, 0) \). — Reason: Converting inequalities to equations lets us plot the boundary lines that enclose the feasible region.
  3. Step 3: Determine which side of each line to shade by testing the origin \( (0, 0) \). Checking \( x + y \le 800 \): \( 0 + 0 = 0 \le 800 \) is true, so shade the origin side. Checking \( 2x + y \le 1000 \): \( 0 \le 1000 \) is true, so shade the origin side. Checking \( x \le 400 \): \( 0 \le 400 \) is true, so shade the origin side. The feasible region is the intersection of all three shaded sides together with the first quadrant. — Reason: A test point tells us which half-plane satisfies each inequality, so we shade only the correct region.
  4. Step 4: Find all corner points of the feasible region. The vertices are: \( O(0, 0) \) (origin), \( A(400, 0) \) (intersection of \( x = 400 \) and x-axis), \( B \) (intersection of \( x = 400 \) and \( x + y = 800 \)), and \( C(0, 800) \) (intersection of \( x + y = 800 \) with the y-axis). To find \( B \): substitute \( x = 400 \) into \( x + y = 800 \), giving \( 400 + y = 800 \), so \( y = 400 \). Wait — we must also check whether \( B \) should come from the intersection of \( 2x + y = 1000 \) and \( x + y = 800 \). Subtracting: \( (2x + y) - (x + y) = 1000 - 800 \) gives \( x = 200 \). Substituting back: \( 200 + y = 800 \) gives \( y = 600 \). Check against \( x \le 400 \): \( 200 \le 400 \) is satisfied. So the correct vertex \( B \) is \( (200, 600) \). — Reason: Corner points are found by solving pairs of boundary equations simultaneously; every active boundary pair must be tested.
  5. Step 5: Re-examine the full set of vertices. The feasible region has corner points: \( O(0, 0) \), \( A(500, 0) \) (intersection of \( 2x + y = 1000 \) with the x-axis, since \( x = 500 \le 400 \) is false — so \( A \) is actually \( (400, 0) \), the intersection of \( x = 400 \) with the x-axis, valid because \( 2(400) + 0 = 800 \le 1000 \)), \( B(200, 600) \) (intersection of \( 2x + y = 1000 \) and \( x + y = 800 \)), and \( C(0, 800) \) (intersection of \( x + y = 800 \) with the y-axis, since \( 2(0) + 800 = 800 \le 1000 \) is satisfied). — Reason: Verifying each candidate vertex against all constraints ensures only truly feasible points are kept.
  6. Step 6: Evaluate the objective function \( z = 4x + 3y \) at each corner point. At \( O(0, 0) \): \( z = 4(0) + 3(0) = 0 \). At \( A(400, 0) \): \( z = 4(400) + 3(0) = 1600 \). At \( B(200, 600) \): \( z = 4(200) + 3(600) = 800 + 1800 = 2600 \). At \( C(0, 800) \): \( z = 4(0) + 3(800) = 2400 \). — Reason: The Corner Point Theorem guarantees the optimum lies at a vertex, so computing \( z \) at every vertex is sufficient to locate the maximum.
  7. Step 7: Compare all four values: \( 0, 1600, 2600, 2400 \). The largest is \( 2600 \), occurring at \( B(200, 600) \). — Reason: A direct numerical comparison identifies which vertex yields the global maximum over the feasible region.

Final Answer

The maximum value is \( z = 2600 \), attained at \( x = 200 \) and \( y = 600 \), i.e. at the corner point \( B(200, 600) \).

Common Mistake

One common mistake: students forget to verify that every candidate corner point satisfies ALL the constraints (not just the two lines used to compute it), which can lead to including infeasible vertices and selecting a wrong maximum.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points of feasible region: \( O(0,0) \), \( A(400,0) \), \( B(200,600) \), \( C(0,800) \). (Intersection of \( 2x+y=1000 \) and \( x+y=800 \) gives \( x=200,\, y=600 \).)
  2. Step 2: Evaluate \( z = 4x + 3y \) at each corner: \( z(O) = 0 \), \( z(A) = 4(400)+3(0) = 1600 \), \( z(B) = 4(200)+3(600) = 800+1800 = 2600 \), \( z(C) = 4(0)+3(800) = 2400 \).
  3. Step 3: Maximum value: \( z = 2600 \) at \( B(200,600) \).

Answer: The maximum value is \( z = 2600 \), attained at \( x = 200 \) and \( y = 600 \), i.e. at the corner point \( B(200, 600) \).

➕ More Examples

More Examples

Example 1

Question: Solve the following linear programming problem graphically: Maximise \( Z = 5x + 4y \) Subject to constraints: \[ x + y \le 600 \] \[ 3x + y \le 900 \] \[ x \le 250 \] \[ x, y \ge 0 \]

Solution: We need to maximise \( Z = 5x + 4y \) subject to the given constraints. First, we find the boundary lines and their intercepts. For \( x + y = 600 \): intercepts are \( (600, 0) \) and \( (0, 600) \). For \( 3x + y = 900 \): intercepts are \( (300, 0) \) and \( (0, 900) \). For \( x = 250 \): a vertical line. The feasible region is bounded by all these constraints along with \( x \ge 0 \) and \( y \ge 0 \). Now we identify the corner points of the feasible region. Corner point A: Intersection of \( x = 0 \) and \( y = 0 \), giving \( A = (0, 0) \). Corner point B: Intersection of \( y = 0 \) and \( 3x + y = 900 \). Setting \( y = 0 \): \( 3x = 900 \), so \( x = 300 \). But \( x \le 250 \), so this point is outside the feasible region. Instead, use \( x = 250 \) and \( y = 0 \), giving \( B = (250, 0) \). Corner point C: Intersection of \( x = 250 \) and \( 3x + y = 900 \). Substituting \( x = 250 \): \( 750 + y = 900 \), so \( y = 150 \). Giving \( C = (250, 150) \). Check \( x + y \le 600 \): \( 250 + 150 = 400 \le 600 \). Valid. Corner point D: Intersection of \( 3x + y = 900 \) and \( x + y = 600 \). Subtracting: \( 2x = 300 \), so \( x = 150 \). Then \( y = 600 - 150 = 450 \). Giving \( D = (150, 450) \). Check \( x \le 250 \): \( 150 \le 250 \). Valid. Corner point E: Intersection of \( x = 0 \) and \( x + y = 600 \), giving \( y = 600 \), so \( E = (0, 600) \). Now evaluate \( Z = 5x + 4y \) at each corner point. At \( A = (0, 0) \): \[ Z = 5(0) + 4(0) = 0 \] At \( B = (250, 0) \): \[ Z = 5(250) + 4(0) = 1250 \] At \( C = (250, 150) \): \[ Z = 5(250) + 4(150) = 1250 + 600 = 1850 \] At \( D = (150, 450) \): \[ Z = 5(150) + 4(450) = 750 + 1800 = 2550 \] At \( E = (0, 600) \): \[ Z = 5(0) + 4(600) = 2400 \] The maximum value of \( Z \) is \( 2550 \) at \( D = (150, 450) \).

Answer: Maximum value of \( Z = 2550 \) at \( x = 150,\ y = 450 \).

Example 2

Question: A manufacturer produces two products P and Q. Each unit of P requires 2 hours on machine I and 1 hour on machine II. Each unit of Q requires 1 hour on machine I and 2 hours on machine II. Machine I is available for at most 700 hours and Machine II for at most 800 hours. The production of P is at most 300 units. If the profit per unit of P is \( \text{Rs. } 60 \) and per unit of Q is \( \text{Rs. } 50 \), formulate and solve the LPP graphically to maximise profit. Maximise \( Z = 60x + 50y \) Subject to constraints: \[ 2x + y \le 700 \] \[ x + 2y \le 800 \] \[ x \le 300 \] \[ x, y \ge 0 \]

Solution: We need to maximise \( Z = 60x + 50y \) subject to the given constraints. Find boundary lines and intercepts. For \( 2x + y = 700 \): intercepts are \( (350, 0) \) and \( (0, 700) \). For \( x + 2y = 800 \): intercepts are \( (800, 0) \) and \( (0, 400) \). For \( x = 300 \): a vertical line. We identify the corner points of the feasible region. Corner point A: \( (0, 0) \). Corner point B: Intersection of \( y = 0 \) and \( 2x + y = 700 \), giving \( x = 350 \). But \( x \le 300 \), so use \( x = 300,\ y = 0 \): \( B = (300, 0) \). Check \( 2(300) + 0 = 600 \le 700 \). Valid. Check \( 300 + 0 = 300 \le 800 \). Valid. Corner point C: Intersection of \( x = 300 \) and \( 2x + y = 700 \). Substituting: \( 600 + y = 700 \), so \( y = 100 \). Giving \( C = (300, 100) \). Check \( x + 2y = 300 + 200 = 500 \le 800 \). Valid. Corner point D: Intersection of \( 2x + y = 700 \) and \( x + 2y = 800 \). From the first equation: \( y = 700 - 2x \). Substituting into the second: \[ x + 2(700 - 2x) = 800 \] \[ x + 1400 - 4x = 800 \] \[ -3x = -600 \] \[ x = 200 \] Then \( y = 700 - 400 = 300 \). Giving \( D = (200, 300) \). Check \( x \le 300 \): \( 200 \le 300 \). Valid. Corner point E: Intersection of \( x = 0 \) and \( x + 2y = 800 \), giving \( y = 400 \), so \( E = (0, 400) \). Now evaluate \( Z = 60x + 50y \) at each corner point. At \( A = (0, 0) \): \[ Z = 60(0) + 50(0) = 0 \] At \( B = (300, 0) \): \[ Z = 60(300) + 50(0) = 18000 \] At \( C = (300, 100) \): \[ Z = 60(300) + 50(100) = 18000 + 5000 = 23000 \] At \( D = (200, 300) \): \[ Z = 60(200) + 50(300) = 12000 + 15000 = 27000 \] At \( E = (0, 400) \): \[ Z = 60(0) + 50(400) = 20000 \] The maximum value of \( Z \) is \( 27000 \) at \( D = (200, 300) \).

Answer: Maximum profit \( Z = \text{Rs. } 27000 \) at \( x = 200,\ y = 300 \) (200 units of P and 300 units of Q).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following linear programming problem graphically: Maximise \( z = 5x + 4y \) Subject to the constraints: \[ x + y \le 900 \] \[ 3x + y \le 1500 \] \[ x \le 400 \] \[ x, y \ge 0 \]

Solution

  1. Step 1: Identify the Constraints and Convert to Equations: The constraints are: (i) \( x + y \le 900 \), so the boundary line is \( x + y = 900 \). (ii) \( 3x + y \le 1500 \), so the boundary line is \( 3x + y = 1500 \). (iii) \( x \le 400 \), so the boundary line is \( x = 400 \). (iv) \( x \ge 0 \) and \( y \ge 0 \) (first quadrant).
  2. Step 2: Find the Intercepts of Each Boundary Line: For \( x + y = 900 \): when \( x = 0 \), \( y = 900 \); when \( y = 0 \), \( x = 900 \). Points: \( (0, 900) \) and \( (900, 0) \). For \( 3x + y = 1500 \): when \( x = 0 \), \( y = 1500 \); when \( y = 0 \), \( x = 500 \). Points: \( (0, 1500) \) and \( (500, 0) \). For \( x = 400 \): a vertical line at \( x = 400 \).
  3. Step 3: Determine the Corner Points of the Feasible Region: The feasible region is bounded. We find the corner points: Corner O: \( (0, 0) \). Corner A: Intersection of \( y = 0 \) and \( 3x + y = 1500 \) gives \( x = 500 \). But check \( x \le 400 \): \( 500 > 400 \), so instead use \( x = 400 \) and \( y = 0 \). So Corner A is \( (400, 0) \). Corner B: Intersection of \( x = 400 \) and \( 3x + y = 1500 \). Substitute \( x = 400 \): \( 3(400) + y = 1500 \), so \( y = 1500 - 1200 = 300 \). Corner B is \( (400, 300) \). Check if \( (400, 300) \) satisfies \( x + y \le 900 \): \( 400 + 300 = 700 \le 900 \). Yes, it is feasible. Corner C: Intersection of \( x + y = 900 \) and \( 3x + y = 1500 \). Subtract the first from the second: \( 2x = 600 \), so \( x = 300 \) and \( y = 900 - 300 = 600 \). Corner C is \( (300, 600) \). Check \( x \le 400 \): \( 300 \le 400 \). Feasible. Corner D: Intersection of \( x + y = 900 \) and \( x = 0 \): \( y = 900 \). Corner D is \( (0, 900) \). So the corner points are: \( O(0,0) \), \( A(400, 0) \), \( B(400, 300) \), \( C(300, 600) \), \( D(0, 900) \).
  4. Step 4: Evaluate the Objective Function at Each Corner Point: The objective function is \( z = 5x + 4y \). At \( O(0, 0) \): \( z = 5(0) + 4(0) = 0 \). At \( A(400, 0) \): \( z = 5(400) + 4(0) = 2000 \). At \( B(400, 300) \): \( z = 5(400) + 4(300) = 2000 + 1200 = 3200 \). At \( C(300, 600) \): \( z = 5(300) + 4(600) = 1500 + 2400 = 3900 \). At \( D(0, 900) \): \( z = 5(0) + 4(900) = 3600 \).
  5. Step 5: Identify the Maximum Value: Comparing the values of \( z \) at all corner points: \( z(O) = 0 \), \( z(A) = 2000 \), \( z(B) = 3200 \), \( z(C) = 3900 \), \( z(D) = 3600 \). The maximum value is \( z = 3900 \), attained at the corner point \( C(300, 600) \).

Answer: The maximum value of \( z = 5x + 4y \) is \( z = 3900 \), attained at \( x = 300 \) and \( y = 600 \), i.e. at the corner point \( C(300, 600) \).

Everything you get with Solver7

More questions in Linear Programming