SOLVER7 Study. Nothing Else.
2026 Board Paper Q29

Solve the following Linear Programming Problem graphically :
\(\begin{align}\text Maximize\ Z = \dfrac{2x}{5}+\dfrac{3y}{10}\\ \text{Subject to constraints }\\ 2x + y \le 1000\\ x + y \le 800\\ 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. You can only make a certain amount of each product because of limited supplies. Drawing lines on a graph helps you see all the allowed combinations. The best earning combination always hides at one of the corner points where those lines meet. Here, checking every corner point shows that making 200 of one item and 600 of another gives the highest score of 260.

Answer: The maximum value of \( Z \) is \( 260 \), attained at the point \( (x, y) = (200, 600) \).

📖 Graphical Solution of an LPP: Maximizing 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 forms the feasible region. A key result (the Corner Point Theorem) states that if an optimal value of the objective function exists, it occurs at one of the corner points (vertices) of the feasible region. So the graphical method involves: drawing the constraint lines, shading the feasible region, finding all corner points, and evaluating the objective function \( Z \) at each corner point to pick the best value.

Formula Used

Objective function: \( Z = \dfrac{2x}{5} + \dfrac{3y}{10} \). Corner Point Theorem: the maximum (or minimum) of \( Z \) over a feasible region occurs at a corner point of that region.

Solution

  1. Step 1: Write down the problem clearly. We must maximize \( Z = \dfrac{2x}{5} + \dfrac{3y}{10} \) subject to \( 2x + y \le 1000 \), \( x + y \le 800 \), and \( x \ge 0 \), \( y \ge 0 \). The last two conditions restrict us to the first quadrant.
  2. Step 2: Convert each inequality to its boundary line to plot it. For \( 2x + y = 1000 \): when \( x = 0 \) we get \( y = 1000 \), and when \( y = 0 \) we get \( x = 500 \). For \( x + y = 800 \): when \( x = 0 \) we get \( y = 800 \), and when \( y = 0 \) we get \( x = 800 \).
  3. Step 3: Decide which side of each line to shade. Test the origin \( (0,0) \). For \( 2x + y \le 1000 \): \( 0 \le 1000 \) is true, so shade the side containing the origin. For \( x + y \le 800 \): \( 0 \le 800 \) is true, so again shade the side containing the origin. The feasible region is the overlap of these two shaded regions, kept in the first quadrant.
  4. Step 4: Find the point of intersection of the two boundary lines, since it may be a corner point. Solve \( 2x + y = 1000 \) and \( x + y = 800 \). Subtracting the second from the first gives \( x = 200 \). Substituting back: \( 200 + y = 800 \), so \( y = 600 \). The intersection point is \( (200, 600) \).
  5. Step 5: List all corner points of the feasible region. Starting from the origin and moving along the boundaries, the vertices are \( O(0,0) \), \( A(500, 0) \) (where \( 2x+y=1000 \) meets the x-axis, and it is closer than \( x=800 \)), \( B(200, 600) \) (the intersection found above), and \( C(0, 800) \) (where \( x+y=800 \) meets the y-axis).
  6. Step 6: Evaluate \( Z = \dfrac{2x}{5} + \dfrac{3y}{10} \) at each corner point. At \( O(0,0) \): \[ Z = 0 \] At \( A(500,0) \): \[ Z = \frac{2(500)}{5} + 0 = 200 \] At \( B(200,600) \): \[ Z = \frac{2(200)}{5} + \frac{3(600)}{10} = 80 + 180 = 260 \] At \( C(0,800) \): \[ Z = 0 + \frac{3(800)}{10} = 240 \]
  7. Step 7: Compare all the values of \( Z \). We have \( 0 \), \( 200 \), \( 260 \), and \( 240 \). The largest value is \( 260 \), which occurs at the corner point \( B(200, 600) \).

Final Answer

The maximum value of \( Z \) is \( 260 \), attained at the point \( (x, y) = (200, 600) \).

Common Mistake

A common mistake is to take \( (800, 0) \) as a corner point on the x-axis. Although \( x + y = 800 \) meets the x-axis there, the point \( (800, 0) \) violates \( 2x + y \le 1000 \) since \( 2(800) + 0 = 1600 > 1000 \). The correct x-axis vertex is \( (500, 0) \), where the binding constraint \( 2x + y = 1000 \) meets the axis. Always check that each candidate corner point satisfies every constraint.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: State the problem clearly: We wish to maximise \( Z = \dfrac{2x}{5} + \dfrac{3y}{10} \) subject to the constraints \( 2x + y \le 1000 \), \( x + y \le 800 \), \( x \ge 0 \), and \( y \ge 0 \). — Reason: Writing the problem explicitly ensures we know which function to optimise and which inequalities form the boundary of the feasible region.
  2. Step 2: Find intercepts of the boundary lines: For the line \( 2x + y = 1000 \): set \( x = 0 \) to get \( y = 1000 \), and set \( y = 0 \) to get \( x = 500 \). So the intercepts are \( (0, 1000) \) and \( (500, 0) \). For the line \( x + y = 800 \): set \( x = 0 \) to get \( y = 800 \), and set \( y = 0 \) to get \( x = 800 \). So the intercepts are \( (0, 800) \) and \( (800, 0) \). — Reason: Two points are enough to draw each straight line on the graph.
  3. Step 3: Identify the feasible region: Test the origin \( (0, 0) \) in each constraint. For \( 2x + y \le 1000 \): substituting gives \( 0 \le 1000 \), which is true, so the origin-side of this line is feasible. For \( x + y \le 800 \): substituting gives \( 0 \le 800 \), also true. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is the area in the first quadrant that lies on or below both lines. — Reason: We need to know which side of each boundary line satisfies the inequality.
  4. Step 4: Find the corner points of the feasible region: The corner points are the vertices of the feasible region. Three of them come directly from the axes: \( O = (0, 0) \), \( A = (500, 0) \), and \( B = (0, 800) \). The fourth corner is the intersection of the two boundary lines \( 2x + y = 1000 \) and \( x + y = 800 \). Subtracting the second equation from the first: \[ (2x + y) - (x + y) = 1000 - 800 \] which simplifies to \( x = 200 \). Substituting \( x = 200 \) into \( x + y = 800 \) gives \( y = 600 \). So the fourth corner is \( C = (200, 600) \). — Reason: By the Corner Point Theorem, the maximum of \( Z \) must occur at one of these vertices.
  5. Step 5: Evaluate Z at each corner point: At \( O = (0, 0) \): \[ Z = \frac{2(0)}{5} + \frac{3(0)}{10} = 0 \] At \( A = (500, 0) \): \[ Z = \frac{2(500)}{5} + \frac{3(0)}{10} = 200 \] At \( B = (0, 800) \): \[ Z = \frac{2(0)}{5} + \frac{3(800)}{10} = 240 \] At \( C = (200, 600) \): \[ Z = \frac{2(200)}{5} + \frac{3(600)}{10} = 80 + 180 = 260 \] — Reason: We compute \( Z \) at every vertex so we can compare all candidate maximum values.
  6. Step 6: Select the maximum value: Comparing the four values — \( 0 \), \( 200 \), \( 240 \), and \( 260 \) — the largest is \( 260 \), occurring at the corner point \( C = (200, 600) \). — Reason: The greatest value among all corner-point evaluations is the global maximum of \( Z \) over the feasible region.

Final Answer

The maximum value of \( Z \) is \( 260 \), attained at the point \( (x, y) = (200, 600) \).

Common Mistake

One common mistake: students forget to check ALL corner points and only evaluate \( Z \) at the intersection of the two non-trivial boundary lines, missing the possibility that an axis-intercept vertex (like \( (0, 800) \) here) might give a larger value.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points of feasible region: \( O(0,0) \), \( A(500,0) \), \( B(200,600) \), \( C(0,800) \). Intersection of \( 2x+y=1000 \) and \( x+y=800 \): subtracting gives \( x=200 \), \( y=600 \).
  2. Step 2: Evaluate \( Z \) at each corner: \( Z(0,0)=0 \), \( Z(500,0)=\dfrac{2(500)}{5}=200 \), \( Z(200,600)=\dfrac{2(200)}{5}+\dfrac{3(600)}{10}=80+180=260 \), \( Z(0,800)=\dfrac{3(800)}{10}=240 \).
  3. Step 3: Maximum value is \( Z=260 \) at \( (200,600) \).

Answer: The maximum value of \( Z \) is \( 260 \), attained at the point \( (x, y) = (200, 600) \).

➕ More Examples

More Examples

Example 1

Question: Solve the following Linear Programming Problem graphically: Maximize \( Z = \dfrac{x}{4} + \dfrac{y}{3} \) subject to the constraints \( 3x + 2y \le 1200 \), \( x + 2y \le 800 \), \( x \ge 0 \), \( y \ge 0 \).

Solution: We need to maximize \( Z = \dfrac{x}{4} + \dfrac{y}{3} \) subject to \( 3x + 2y \le 1200 \), \( x + 2y \le 800 \), \( x \ge 0 \), \( y \ge 0 \). Finding boundary lines and intercepts: For \( 3x + 2y = 1200 \): x-intercept at \( (400, 0) \), y-intercept at \( (0, 600) \). For \( x + 2y = 800 \): x-intercept at \( (800, 0) \), y-intercept at \( (0, 400) \). Finding the intersection of \( 3x + 2y = 1200 \) and \( x + 2y = 800 \): Subtracting the second equation from the first: \( 2x = 400 \), so \( x = 200 \). Substituting into \( x + 2y = 800 \): \( 200 + 2y = 800 \), giving \( y = 300 \). Intersection point: \( (200, 300) \). The feasible region is bounded by the origin and satisfies all constraints. The corner points are: \( A = (0, 0) \), \( B = (400, 0) \), \( C = (200, 300) \), \( D = (0, 400) \). Note: \( (800, 0) \) does NOT satisfy \( 3x + 2y \le 1200 \) since \( 3(800) = 2400 > 1200 \), so it is outside the feasible region. Evaluating \( Z = \dfrac{x}{4} + \dfrac{y}{3} \) at each corner point: At \( A = (0, 0) \): \[ Z = \frac{0}{4} + \frac{0}{3} = 0 \] At \( B = (400, 0) \): \[ Z = \frac{400}{4} + \frac{0}{3} = 100 \] At \( C = (200, 300) \): \[ Z = \frac{200}{4} + \frac{300}{3} = 50 + 100 = 150 \] At \( D = (0, 400) \): \[ Z = \frac{0}{4} + \frac{400}{3} = \frac{400}{3} \approx 133.33 \] The maximum value of Z is \( 150 \) at the point \( (200, 300) \).

Answer: Maximum \( Z = 150 \) at \( x = 200 \), \( y = 300 \).

Example 2

Question: A factory produces two products P and Q. The profit per unit of P is \( \rupee \, 5 \) and per unit of Q is \( \rupee \, 8 \). The production is subject to the constraints: \( 4x + 2y \le 600 \) and \( 2x + 4y \le 480 \), where \( x \) and \( y \) are the numbers of units of P and Q produced respectively. Also \( x \ge 0 \), \( y \ge 0 \). Formulate and solve graphically the Linear Programming Problem to maximize the total profit \( Z = 5x + 8y \).

Solution: We need to maximize \( Z = 5x + 8y \) subject to \( 4x + 2y \le 600 \), \( 2x + 4y \le 480 \), \( x \ge 0 \), \( y \ge 0 \). Finding boundary lines and intercepts: For \( 4x + 2y = 600 \): x-intercept at \( (150, 0) \), y-intercept at \( (0, 300) \). For \( 2x + 4y = 480 \): x-intercept at \( (240, 0) \), y-intercept at \( (0, 120) \). Finding the intersection of \( 4x + 2y = 600 \) and \( 2x + 4y = 480 \): Multiplying the second equation by 2: \( 4x + 8y = 960 \). Subtracting the first equation: \( 6y = 360 \), so \( y = 60 \). Substituting into \( 2x + 4(60) = 480 \): \( 2x = 240 \), so \( x = 120 \). Intersection point: \( (120, 60) \). Checking corner points of the feasible region: \( (0, 0) \): satisfies both constraints. \( (150, 0) \): check \( 2(150) + 4(0) = 300 \le 480 \) — valid. \( (0, 120) \): check \( 4(0) + 2(120) = 240 \le 600 \) — valid. Note: \( (0, 300) \) does NOT satisfy \( 2x + 4y \le 480 \) since \( 4(300) = 1200 > 480 \). The corner points of the feasible region are: \( O = (0, 0) \), \( A = (150, 0) \), \( B = (120, 60) \), \( C = (0, 120) \). Evaluating \( Z = 5x + 8y \) at each corner point: At \( O = (0, 0) \): \[ Z = 5(0) + 8(0) = 0 \] At \( A = (150, 0) \): \[ Z = 5(150) + 8(0) = 750 \] At \( B = (120, 60) \): \[ Z = 5(120) + 8(60) = 600 + 480 = 1080 \] At \( C = (0, 120) \): \[ Z = 5(0) + 8(120) = 960 \] The maximum value of Z is \( 1080 \) at the point \( (120, 60) \).

Answer: Maximum profit \( Z = \rupee \, 1080 \) at \( x = 120 \) units of P and \( y = 60 \) units of Q.

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = \dfrac{x}{4} + \dfrac{y}{2} \) subject to the constraints \( 3x + y \le 1200 \), \( x + y \le 600 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1 — Identify the constraints and objective function: The objective function is \( Z = \dfrac{x}{4} + \dfrac{y}{2} \). The constraints are \( 3x + y \le 1200 \), \( x + y \le 600 \), \( x \ge 0 \), \( y \ge 0 \).
  2. Step 2 — Draw the boundary lines: Line 1: \( 3x + y = 1200 \). Set \( x = 0 \): \( y = 1200 \), and set \( y = 0 \): \( x = 400 \). So the intercepts are \( (0,\,1200) \) and \( (400,\,0) \). Line 2: \( x + y = 600 \). Set \( x = 0 \): \( y = 600 \), and set \( y = 0 \): \( x = 600 \). So the intercepts are \( (0,\,600) \) and \( (600,\,0) \). Plot both lines and shade the region that satisfies all constraints (below both lines and in the first quadrant).
  3. Step 3 — Find the corner points of the feasible region: The feasible region is a polygon. Its 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 \( y = 0 \) and \( 3x + y = 1200 \) gives \( (400,\,0) \). Corner C: intersection of the two lines \( 3x + y = 1200 \) and \( x + y = 600 \). Subtracting the second from the first: \( 2x = 600 \), so \( x = 300 \). Substituting back: \( 300 + y = 600 \), so \( y = 300 \). Corner C is \( (300,\,300) \). Corner D: intersection of \( x = 0 \) and \( x + y = 600 \) gives \( (0,\,600) \). Note: \( (0,\,1200) \) does NOT satisfy \( x + y \le 600 \), so it is outside the feasible region.
  4. Step 4 — Evaluate Z at each corner point: At \( A = (0,\,0) \): \( Z = \dfrac{0}{4} + \dfrac{0}{2} = 0 \). At \( B = (400,\,0) \): \( Z = \dfrac{400}{4} + \dfrac{0}{2} = 100 \). At \( C = (300,\,300) \): \( Z = \dfrac{300}{4} + \dfrac{300}{2} = 75 + 150 = 225 \). At \( D = (0,\,600) \): \( Z = \dfrac{0}{4} + \dfrac{600}{2} = 300 \).
  5. Step 5 — Identify the maximum: Comparing all values: \( Z(A) = 0 \), \( Z(B) = 100 \), \( Z(C) = 225 \), \( Z(D) = 300 \). The maximum value of \( Z \) is \( 300 \), attained at the corner point \( (0,\,600) \).

Answer: The maximum value of \( Z \) is \( 300 \), attained at the point \( (x, y) = (0,\,600) \).

Everything you get with Solver7

More questions in Linear Programming