SOLVER7 Study. Nothing Else.
2026 Board Paper Q31

Solve the following linear programming problem graphically :
\(\begin{align}\text{Maximize Z = 4500x + 5000y}\\ \text{Subject to constraints }\\ x + y \le 250\\ 25x + 40y \le 7000\\ x \ge 0,\ y\ge 0\end{align}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine a farmer who can grow two crops and wants to earn the most money possible. There are limits, like the total land available and the total water supply. We try every "corner" combination of the two crops that fits within all the limits. The corner that gives the highest earnings wins. Here, planting 200 units of one crop and 50 units of the other uses up resources perfectly and gives the biggest profit of 1,150,000.

Answer: The maximum value of \( Z \) is \( 1150000 \), attained at \( x = 200 \) and \( y = 50 \).

📖 Graphical Solution of an LPP (Maximize Z)

Detailed Explanation

In Linear Programming, we optimize (maximize or minimize) 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. According to the Corner Point Theorem, if an optimal value of the objective function exists, it must occur at one (or more) of the corner points (vertices) of the feasible region. So the graphical method involves: converting each inequality into a line, plotting these lines, shading the region that satisfies all constraints, identifying the corner points, and finally evaluating the objective function at each corner to pick the best value. Here we maximize \( Z = 4500x + 5000y \) subject to \( x + y \le 250 \), \( 25x + 40y \le 7000 \), and \( x \ge 0, \ y \ge 0 \).

Formula Used

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

Solution

  1. Step 1: Convert each inequality into its boundary line. For \( x + y \le 250 \), the line is \( x + y = 250 \), which meets the axes at \( (250, 0) \) and \( (0, 250) \). For \( 25x + 40y \le 7000 \), the line is \( 25x + 40y = 7000 \), which meets the axes at \( (280, 0) \) and \( (0, 175) \).
  2. Step 2: Decide the correct side of each line by testing the origin \( (0,0) \). For \( x + y \le 250 \): \( 0 \le 250 \) is true, so we take the side containing the origin. For \( 25x + 40y \le 7000 \): \( 0 \le 7000 \) is true, so again the origin side. With \( x \ge 0 \) and \( y \ge 0 \), the feasible region lies in the first quadrant.
  3. Step 3: Find the point where the two boundary lines intersect. Solve \( x + y = 250 \) and \( 25x + 40y = 7000 \). From the first, \( x = 250 - y \). Substitute: \[ 25(250 - y) + 40y = 7000 \] \[ 6250 - 25y + 40y = 7000 \] \[ 15y = 750 \] \[ y = 50 \] Then \( x = 250 - 50 = 200 \), giving the intersection point \( (200, 50) \).
  4. Step 4: Identify the corner points of the feasible region. They are the origin \( (0, 0) \), the point on the x-axis \( (250, 0) \), the intersection point \( (200, 50) \), and the point on the y-axis \( (0, 175) \). Note we use \( (0,175) \), not \( (0,250) \), because \( (0,250) \) violates \( 25x + 40y \le 7000 \).
  5. Step 5: Evaluate \( Z = 4500x + 5000y \) at each corner point. At \( (0,0) \): \( Z = 0 \). At \( (250, 0) \): \( Z = 4500(250) = 1125000 \). At \( (200, 50) \): \( Z = 4500(200) + 5000(50) = 900000 + 250000 = 1150000 \). At \( (0, 175) \): \( Z = 5000(175) = 875000 \).
  6. Step 6: Compare all values of \( Z \). The values are \( 0 \), \( 1125000 \), \( 1150000 \), and \( 875000 \). The greatest is \( 1150000 \), which occurs at the corner point \( (200, 50) \). Hence this is the optimal solution.

Final Answer

The maximum value of \( Z \) is \( 1150000 \), attained at \( x = 200 \) and \( y = 50 \).

Common Mistake

A common mistake is taking \( (0, 250) \) as a corner point just because it lies on \( x + y = 250 \). But \( (0, 250) \) does not satisfy \( 25x + 40y \le 7000 \), so it is outside the feasible region. Always verify that each candidate corner point satisfies every constraint before using it.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write the boundary lines of each constraint: Replace each inequality with its corresponding equality to get the boundary lines. Constraint 1 gives the line \( x + y = 250 \). Setting \( y = 0 \) yields the x-intercept \( (250, 0) \); setting \( x = 0 \) yields the y-intercept \( (0, 250) \). Constraint 2 gives the line \( 25x + 40y = 7000 \). Setting \( y = 0 \) gives \( x = 280 \), so the x-intercept is \( (280, 0) \); setting \( x = 0 \) gives \( y = 175 \), so the y-intercept is \( (0, 175) \). Reason: Boundary lines form the edges of the feasible region, and we need their intercepts to plot them accurately.
  2. Step 2: Identify the feasible side of each boundary line: Test the origin \( (0, 0) \) in each inequality. For Constraint 1: \( 0 + 0 = 0 \le 250 \) — true, so the feasible side is the side containing the origin. For Constraint 2: \( 25(0) + 40(0) = 0 \le 7000 \) — true, so again the feasible side contains the origin. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region lies in the first quadrant on the origin-side of both lines. Reason: Testing a known point tells us which half-plane satisfies each inequality, so we shade the correct region.
  3. Step 3: Find the intersection point of the two boundary lines: Solve the system \( x + y = 250 \) and \( 25x + 40y = 7000 \) simultaneously. From the first equation, \( x = 250 - y \). Substituting into the second equation: \[ 25(250 - y) + 40y = 7000 \] Expanding: \[ 6250 - 25y + 40y = 7000 \] Simplifying: \[ 15y = 750 \] So \( y = 50 \). Then \( x = 250 - 50 = 200 \). The intersection point is \( (200, 50) \). Reason: This intersection is a vertex of the feasible region and is the key candidate for the optimal solution.
  4. Step 4: List all corner points of the feasible region: The feasible region is a bounded polygon in the first quadrant. Its vertices are found where the boundary lines meet the axes and each other. The corner points are: \( (0, 0) \), \( (250, 0) \), \( (200, 50) \), and \( (0, 175) \). Reason: By the Corner Point Theorem, the maximum of \( Z \) must occur at one of these vertices, so we only need to check these four points.
  5. Step 5: Evaluate the objective function at each corner point: Calculate \( Z = 4500x + 5000y \) at every vertex. At \( (0, 0) \): \[ Z = 4500(0) + 5000(0) = 0 \] At \( (250, 0) \): \[ Z = 4500(250) + 5000(0) = 1125000 \] At \( (200, 50) \): \[ Z = 4500(200) + 5000(50) = 900000 + 250000 = 1150000 \] At \( (0, 175) \): \[ Z = 4500(0) + 5000(175) = 875000 \] Reason: We substitute each corner point into the objective function to compare values and identify which gives the largest result.
  6. Step 6: Select the maximum value: Comparing all computed values — \( 0 \), \( 1125000 \), \( 1150000 \), and \( 875000 \) — the largest is \( 1150000 \), achieved at the corner point \( (200, 50) \). Reason: The highest value of \( Z \) among all corner points is the maximum of the objective function over the entire feasible region.

Final Answer

The maximum value of \( Z \) is \( 1150000 \), attained at \( x = 200 \) and \( y = 50 \).

Common Mistake

One common mistake: Students sometimes find the intersection of the two boundary lines correctly but forget to also check the axis-intercept corner points such as \( (250, 0) \) and \( (0, 175) \), which can lead them to miss the true maximum or minimum.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Boundary lines: \( x + y = 250 \) meets axes at \( (250,0) \) and \( (0,250) \); \( 25x + 40y = 7000 \) meets axes at \( (280,0) \) and \( (0,175) \).
  2. Step 2: Intersection of the two boundary lines — solve simultaneously: from \( x + y = 250 \) substitute \( x = 250 - y \) into \( 25(250 - y) + 40y = 7000 \), giving \( 6250 + 15y = 7000 \), so \( y = 50 \) and \( x = 200 \). Corner points of feasible region: \( O(0,0) \), \( A(250,0) \), \( B(200,50) \), \( C(0,175) \).
  3. Step 3: Evaluate \( Z = 4500x + 5000y \) at each corner: \( Z(O) = 0 \), \( Z(A) = 4500(250) = 1125000 \), \( Z(B) = 4500(200) + 5000(50) = 900000 + 250000 = 1150000 \), \( Z(C) = 5000(175) = 875000 \).

Answer: The maximum value of \( Z \) is \( 1150000 \), attained at \( x = 200 \) and \( y = 50 \).

➕ More Examples

More Examples

Example 1

Question: Solve the following linear programming problem graphically: Maximise \( Z = 3000x + 4000y \) Subject to the constraints: \[ x + y \le 300 \] \[ 20x + 30y \le 7200 \] \[ x \ge 0,\quad y \ge 0 \]

Solution: We need to maximise \( Z = 3000x + 4000y \) subject to the given constraints. Constraint 1: \( x + y \le 300 \) The boundary line is \( x + y = 300 \). Its intercepts are \( (300, 0) \) and \( (0, 300) \). Constraint 2: \( 20x + 30y \le 7200 \) Simplifying by dividing by 10: \( 2x + 3y \le 720 \). The boundary line is \( 2x + 3y = 720 \). Its intercepts are \( (360, 0) \) and \( (0, 240) \). Non-negativity: \( x \ge 0,\; y \ge 0 \). Finding the corner points of the feasible region: Corner A: Intersection of the x-axis and \( x + y = 300 \): point \( (300, 0) \). Check constraint 2: \( 2(300) + 3(0) = 600 \le 720 \). Valid. Corner B: Intersection of \( x + y = 300 \) and \( 2x + 3y = 720 \). From \( x + y = 300 \), we get \( x = 300 - y \). Substituting into \( 2x + 3y = 720 \): \[ 2(300 - y) + 3y = 720 \] \[ 600 - 2y + 3y = 720 \] \[ y = 120 \] So \( x = 300 - 120 = 180 \). Corner B is \( (180, 120) \). Corner C: Intersection of the y-axis and \( 2x + 3y = 720 \): \( x = 0,\; y = 240 \). Point \( (0, 240) \). Check constraint 1: \( 0 + 240 = 240 \le 300 \). Valid. Corner O: Origin \( (0, 0) \). Now evaluate \( Z = 3000x + 4000y \) at each corner point: At \( O(0, 0) \): \[ Z = 3000(0) + 4000(0) = 0 \] At \( A(300, 0) \): \[ Z = 3000(300) + 4000(0) = 900000 \] At \( B(180, 120) \): \[ Z = 3000(180) + 4000(120) = 540000 + 480000 = 1020000 \] At \( C(0, 240) \): \[ Z = 3000(0) + 4000(240) = 960000 \] The maximum value of Z is \( 1020000 \) at the point \( (180, 120) \).

Answer: Maximum \( Z = 1020000 \) at \( x = 180,\; y = 120 \).

Example 2

Question: Solve the following linear programming problem graphically: Maximise \( Z = 600x + 800y \) Subject to the constraints: \[ x + 2y \le 160 \] \[ 3x + 2y \le 240 \] \[ x \ge 0,\quad y \ge 0 \]

Solution: We need to maximise \( Z = 600x + 800y \) subject to the given constraints. Constraint 1: \( x + 2y \le 160 \) The boundary line is \( x + 2y = 160 \). Its intercepts are \( (160, 0) \) and \( (0, 80) \). Constraint 2: \( 3x + 2y \le 240 \) The boundary line is \( 3x + 2y = 240 \). Its intercepts are \( (80, 0) \) and \( (0, 120) \). Non-negativity: \( x \ge 0,\; y \ge 0 \). Finding the corner points of the feasible region: Corner O: Origin \( (0, 0) \). Corner A: Intersection of the x-axis and \( 3x + 2y = 240 \): \( y = 0,\; x = 80 \). Point \( (80, 0) \). Check constraint 1: \( 80 + 0 = 80 \le 160 \). Valid. Corner B: Intersection of \( x + 2y = 160 \) and \( 3x + 2y = 240 \). Subtracting the first from the second: \[ (3x + 2y) - (x + 2y) = 240 - 160 \] \[ 2x = 80 \] \[ x = 40 \] Substituting back into \( x + 2y = 160 \): \[ 40 + 2y = 160 \] \[ y = 60 \] Corner B is \( (40, 60) \). Corner C: Intersection of the y-axis and \( x + 2y = 160 \): \( x = 0,\; y = 80 \). Point \( (0, 80) \). Check constraint 2: \( 0 + 2(80) = 160 \le 240 \). Valid. Now evaluate \( Z = 600x + 800y \) at each corner point: At \( O(0, 0) \): \[ Z = 600(0) + 800(0) = 0 \] At \( A(80, 0) \): \[ Z = 600(80) + 800(0) = 48000 \] At \( B(40, 60) \): \[ Z = 600(40) + 800(60) = 24000 + 48000 = 72000 \] At \( C(0, 80) \): \[ Z = 600(0) + 800(80) = 64000 \] The maximum value of Z is \( 72000 \) at the point \( (40, 60) \).

Answer: Maximum \( Z = 72000 \) at \( x = 40,\; y = 60 \).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following linear programming problem graphically: Maximize \ \( Z = 3000x + 4000y \) Subject to the constraints: \[ x + y \le 300 \] \[ 20x + 30y \le 7200 \] \[ x \ge 0, \quad y \ge 0 \]

Solution

  1. Step 1 – Identify the constraints and convert to equations: The constraints are: (i) \( x + y \le 300 \), treated as \( x + y = 300 \) (ii) \( 20x + 30y \le 7200 \), treated as \( 20x + 30y = 7200 \), i.e. \( 2x + 3y = 720 \) (iii) \( x \ge 0, \quad y \ge 0 \)
  2. Step 2 – Find intercepts of each boundary line: For \( x + y = 300 \): when \( x = 0 \), \( y = 300 \); when \( y = 0 \), \( x = 300 \). So the line passes through \( (0, 300) \) and \( (300, 0) \). For \( 2x + 3y = 720 \): when \( x = 0 \), \( y = 240 \); when \( y = 0 \), \( x = 360 \). So the line passes through \( (0, 240) \) and \( (360, 0) \).
  3. Step 3 – Find the point of intersection of the two lines: Solve the system: \[ x + y = 300 \] \[ 2x + 3y = 720 \] From the first equation, \( y = 300 - x \). Substituting into the second equation: \[ 2x + 3(300 - x) = 720 \] \[ 2x + 900 - 3x = 720 \] \[ -x = -180 \] \[ x = 180 \] Then \( y = 300 - 180 = 120 \). The intersection point is \( (180,\, 120) \).
  4. Step 4 – 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: A: \( (0, 0) \) B: \( (300, 0) \) — intersection of \( x + y = 300 \) with the x-axis C: \( (180, 120) \) — intersection of the two boundary lines D: \( (0, 240) \) — intersection of \( 2x + 3y = 720 \) with the y-axis Note: \( (0, 300) \) does NOT satisfy \( 2x + 3y \le 720 \) since \( 3(300) = 900 > 720 \), so it is outside the feasible region.
  5. Step 5 – Evaluate Z at each corner point: At A \( (0, 0) \): \[ Z = 3000(0) + 4000(0) = 0 \] At B \( (300, 0) \): \[ Z = 3000(300) + 4000(0) = 900000 \] At C \( (180, 120) \): \[ Z = 3000(180) + 4000(120) = 540000 + 480000 = 1020000 \] At D \( (0, 240) \): \[ Z = 3000(0) + 4000(240) = 960000 \]
  6. Step 6 – Identify the maximum: Comparing all values: \( Z_A = 0 \), \( Z_B = 900000 \), \( Z_C = 1020000 \), \( Z_D = 960000 \). The maximum value is \( Z = 1020000 \), attained at the corner point \( C = (180, 120) \).

Answer: The maximum value of \( Z \) is \( 1020000 \), attained at \( x = 180 \) and \( y = 120 \).

Everything you get with Solver7

More questions in Linear Programming