SOLVER7 Study. Nothing Else.
2026 Board Paper Q30

Solve the following linear programming problem graphically :
\(\begin{align}\text{Maximize Z = 13x - 15y}\\ \text{Subject to constraints }\\ x + y \le 7\\ 2x - 3y +6\ge0,\\ x \ge 0,\ y\ge 0\end{align}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are trying to earn as much money as possible, but you only have limited resources. A farmer might want the biggest harvest from a small plot of land. Here, we want to make the value of \( Z = 13x - 15y \) as large as we can. The rules about \( x \) and \( y \) create a safe zone on a graph called the feasible region. We check every corner of that zone, because the best answer always hides at a corner. The winning corner turns out to be the point \( (7, 0) \), giving a maximum value of \( 91 \).

Answer: The maximum value of \( Z \) is \( 91 \), attained at the corner point \( (7, 0) \), that is, at \( x = 7 \) and \( y = 0 \).

📖 Graphical Solution of an LPP: Maximize Z = 13x - 15y

Detailed Explanation

In Linear Programming, we optimize (maximize or minimize) a linear function called the objective function, here \( Z = 13x - 15y \), subject to a set of linear inequalities called constraints. The set of all points satisfying every constraint is called the feasible region. A key theorem states that the optimal value of the objective function, if it exists on a bounded feasible region, always occurs at one of the corner points (vertices) of that region. So the strategy is: draw the boundary lines of each constraint, shade the region satisfying all inequalities, locate every corner point, and evaluate \( Z \) at each corner. The largest value gives the maximum.

Formula Used

Corner Point Method: Evaluate the objective function \( Z = 13x - 15y \) at every corner point of the feasible region, and choose the point that gives the maximum value of \( Z \).

Solution

  1. Step 1: Write down the constraints clearly. We must maximize \( Z = 13x - 15y \) subject to \( x + y \le 7 \), \( 2x - 3y + 6 \ge 0 \), \( x \ge 0 \), and \( 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 its boundary line. For \( x + y \le 7 \), the line is \( x + y = 7 \), which passes through \( (7, 0) \) and \( (0, 7) \). For \( 2x - 3y + 6 \ge 0 \), the line is \( 2x - 3y + 6 = 0 \), which passes through \( (-3, 0) \) and \( (0, 2) \).
  3. Step 3: Decide which side of each line to shade using the test point \( (0, 0) \). For \( x + y \le 7 \): substituting gives \( 0 \le 7 \), which is true, so shade the side containing the origin. For \( 2x - 3y + 6 \ge 0 \): substituting gives \( 6 \ge 0 \), which is true, so again shade the side containing 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.
  4. Step 4: Find the corner points of the feasible region. Start with the axis points. The origin \( (0, 0) \) satisfies all constraints. On the y-axis, the line \( 2x - 3y + 6 = 0 \) meets it at \( (0, 2) \). On the x-axis, the line \( x + y = 7 \) meets it at \( (7, 0) \).
  5. Step 5: Find the intersection of the two slanted lines. Solve \( x + y = 7 \) and \( 2x - 3y + 6 = 0 \) together. From the first, \( x = 7 - y \). Substituting: \[ 2(7 - y) - 3y + 6 = 0 \] \[ 14 - 2y - 3y + 6 = 0 \] \[ 20 - 5y = 0 \] So \( y = 4 \) and \( x = 7 - 4 = 3 \). The intersection point is \( (3, 4) \).
  6. Step 6: List all corner points of the feasible region: \( (0, 0) \), \( (7, 0) \), \( (3, 4) \), and \( (0, 2) \). These form the vertices of the bounded feasible region.
  7. Step 7: Evaluate \( Z = 13x - 15y \) at each corner point. At \( (0, 0) \): \( Z = 13(0) - 15(0) = 0 \). At \( (7, 0) \): \( Z = 13(7) - 15(0) = 91 \). At \( (3, 4) \): \( Z = 13(3) - 15(4) = 39 - 60 = -21 \). At \( (0, 2) \): \( Z = 13(0) - 15(2) = -30 \).
  8. Step 8: Compare the values: \( 0 \), \( 91 \), \( -21 \), and \( -30 \). The largest value is \( 91 \), which occurs at the point \( (7, 0) \).

Final Answer

The maximum value of \( Z \) is \( 91 \), attained at the corner point \( (7, 0) \), that is, at \( x = 7 \) and \( y = 0 \).

Common Mistake

A very common error is to shade the wrong side of the line \( 2x - 3y + 6 \ge 0 \). Students often assume it excludes the origin, but testing \( (0, 0) \) gives \( 6 \ge 0 \), which is true, so the origin IS in the feasible region. Another frequent mistake is forgetting to check the corner point \( (0, 0) \) or evaluating \( Z \) at only some vertices instead of all of them.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the Problem: We want to maximise the objective function \( Z = 13x - 15y \) subject to the constraints: \( x + y \le 7 \), \( 2x - 3y + 6 \ge 0 \), \( x \ge 0 \), and \( y \ge 0 \). — Reason: Writing all constraints explicitly prevents missing any boundary, and the non-negativity conditions \( x \ge 0 \), \( y \ge 0 \) confine the solution to the first quadrant.
  2. Step 2: Find the Boundary Lines: Replace each inequality with its corresponding equation to get the boundary lines. For \( x + y \le 7 \), the boundary is \( x + y = 7 \), passing through \( (7, 0) \) and \( (0, 7) \). For \( 2x - 3y + 6 \ge 0 \), the boundary is \( 2x - 3y + 6 = 0 \), passing through \( (0, 2) \) and \( (3, 4) \) (found by setting \( x = 0 \) to get \( y = 2 \), and setting \( y = 0 \) to get \( x = -3 \), then checking the intersection with \( x + y = 7 \)). — Reason: Boundary lines define the edges of the feasible region, and we need two points on each line to draw it accurately.
  3. Step 3: Determine the Feasible Side of Each Inequality: Test the origin \( (0, 0) \) in each inequality. For \( x + y \le 7 \): substituting gives \( 0 + 0 = 0 \le 7 \), which is true, so the origin side is feasible. For \( 2x - 3y + 6 \ge 0 \): substituting gives \( 0 - 0 + 6 = 6 \ge 0 \), which is also true, so again the origin side is feasible. — Reason: The test-point method quickly tells us which half-plane to shade without needing to rearrange the inequality.
  4. Step 4: Find the Corner Points of the Feasible Region: The feasible region lies in the first quadrant, so corners include points on the axes and intersections of boundary lines. The corner points are: \( (0, 0) \) (origin), \( (7, 0) \) (intersection of \( x + y = 7 \) with the x-axis), \( (0, 2) \) (intersection of \( 2x - 3y + 6 = 0 \) with the y-axis, since setting \( x = 0 \) gives \( -3y + 6 = 0 \Rightarrow y = 2 \)), and \( (3, 4) \) (intersection of the two boundary lines, found by solving \( x + y = 7 \) and \( 2x - 3y + 6 = 0 \) simultaneously). To verify \( (3, 4) \): from \( x + y = 7 \), we get \( x = 7 - y \); substituting into \( 2x - 3y + 6 = 0 \) gives \( 2(7 - y) - 3y + 6 = 0 \), so \( 14 - 2y - 3y + 6 = 0 \), hence \( 20 = 5y \) and \( y = 4 \), giving \( x = 3 \). — Reason: The optimal value of \( Z \) can only occur at a corner point, so we must locate all vertices precisely.
  5. Step 5: Evaluate Z at Each Corner Point: Substitute each corner point into \( Z = 13x - 15y \). At \( (0, 0) \): \( Z = 13(0) - 15(0) = 0 \). At \( (7, 0) \): \( Z = 13(7) - 15(0) = 91 \). At \( (0, 2) \): \( Z = 13(0) - 15(2) = -30 \). At \( (3, 4) \): \( Z = 13(3) - 15(4) = 39 - 60 = -21 \). — Reason: The Corner Point Theorem guarantees the maximum lies at one of these vertices, so we evaluate \( Z \) at all of them and compare.
  6. Step 6: Identify the Maximum: Comparing all values: \( Z = 0 \) at \( (0,0) \), \( Z = 91 \) at \( (7, 0) \), \( Z = -30 \) at \( (0, 2) \), and \( Z = -21 \) at \( (3, 4) \). The largest value is \( 91 \), achieved at \( (7, 0) \). — Reason: The maximum of \( Z \) over the feasible region is the greatest among all the values computed at the corner points.

Final Answer

The maximum value of \( Z \) is \( 91 \), attained at the corner point \( (7, 0) \), that is, at \( x = 7 \) and \( y = 0 \).

Common Mistake

One common mistake: Students sometimes forget to check ALL corner points (especially those on the axes) and only evaluate \( Z \) at interior intersection points, which can lead to missing the true maximum or minimum.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Boundary lines: \( x + y = 7 \) through \( (7,0) \) and \( (0,7) \); \( 2x - 3y + 6 = 0 \) through \( (-3,0) \) and \( (0,2) \).
  2. Step 2: Corner points of feasible region: \( (0,0) \), \( (7,0) \), \( (0,2) \), and \( (3,4) \) (intersection of \( x+y=7 \) and \( 2x-3y+6=0 \)).
  3. Step 3: Evaluate \( Z = 13x - 15y \) at each corner: \( (0,0) \Rightarrow 0 \); \( (7,0) \Rightarrow 91 \); \( (0,2) \Rightarrow -30 \); \( (3,4) \Rightarrow 39 - 60 = -21 \).

Answer: The maximum value of \( Z \) is \( 91 \), attained at the corner point \( (7, 0) \), that is, at \( x = 7 \) and \( y = 0 \).

➕ More Examples

More Examples

Example 1

Question: Solve the following linear programming problem graphically: Maximize \[Z = 5x + 4y\] Subject to the constraints: \[x + y \le 8\] \[3x + y \le 18\] \[x \ge 0,\quad y \ge 0\]

Solution: We need to maximize \(Z = 5x + 4y\) subject to the given constraints. Step 1: Draw the boundary lines. For \(x + y = 8\): passes through \((0, 8)\) and \((8, 0)\). For \(3x + y = 18\): passes through \((0, 18)\) and \((6, 0)\). Also, \(x \ge 0\) and \(y \ge 0\) restrict us to the first quadrant. Step 2: Identify the feasible region. The feasible region is bounded by all four constraints and lies in the first quadrant below both lines. Step 3: Find the corner points. Corner A: Intersection of \(x = 0\) and \(y = 0\) gives \((0, 0)\). Corner B: Intersection of \(3x + y = 18\) and \(y = 0\) gives \((6, 0)\). Corner C: Intersection of \(x + y = 8\) and \(3x + y = 18\). Subtracting the first from the second: \[3x + y - (x + y) = 18 - 8\] \[2x = 10\] \[x = 5\] Substituting back: \(5 + y = 8\), so \(y = 3\). Corner C is \((5, 3)\). Corner D: Intersection of \(x + y = 8\) and \(x = 0\) gives \((0, 8)\). Step 4: Evaluate Z at each corner point. At \(A(0, 0)\): \[Z = 5(0) + 4(0) = 0\] At \(B(6, 0)\): \[Z = 5(6) + 4(0) = 30\] At \(C(5, 3)\): \[Z = 5(5) + 4(3) = 25 + 12 = 37\] At \(D(0, 8)\): \[Z = 5(0) + 4(8) = 32\] Step 5: Compare the values. The maximum value of Z is 37 at the point \((5, 3)\).

Answer: Maximum value of Z = 37 at (5, 3).

Example 2

Question: Solve the following linear programming problem graphically: Maximize \[Z = 6x + 9y\] Subject to the constraints: \[2x + y \le 10\] \[x + 3y \le 12\] \[x \ge 0,\quad y \ge 0\]

Solution: We need to maximize \(Z = 6x + 9y\) subject to the given constraints. Step 1: Draw the boundary lines. For \(2x + y = 10\): passes through \((0, 10)\) and \((5, 0)\). For \(x + 3y = 12\): passes through \((0, 4)\) and \((12, 0)\). Also, \(x \ge 0\) and \(y \ge 0\) restrict us to the first quadrant. Step 2: Identify the feasible region. The feasible region satisfies both inequality constraints and is in the first quadrant. Step 3: Find the corner points. Corner A: Intersection of \(x = 0\) and \(y = 0\) gives \((0, 0)\). Corner B: Intersection of \(2x + y = 10\) and \(y = 0\) gives \((5, 0)\). Corner C: Intersection of \(2x + y = 10\) and \(x + 3y = 12\). From the first equation: \(y = 10 - 2x\). Substituting into the second: \[x + 3(10 - 2x) = 12\] \[x + 30 - 6x = 12\] \[-5x = -18\] \[x = \frac{18}{5}\] Then \(y = 10 - 2 \cdot \frac{18}{5} = 10 - \frac{36}{5} = \frac{14}{5}\). So Corner C is \(\left(\frac{18}{5},\, \frac{14}{5}\right)\). Corner D: Intersection of \(x + 3y = 12\) and \(x = 0\) gives \((0, 4)\). Step 4: Evaluate Z at each corner point. At \(A(0, 0)\): \[Z = 6(0) + 9(0) = 0\] At \(B(5, 0)\): \[Z = 6(5) + 9(0) = 30\] At \(C\left(\frac{18}{5}, \frac{14}{5}\right)\): \[Z = 6 \cdot \frac{18}{5} + 9 \cdot \frac{14}{5} = \frac{108}{5} + \frac{126}{5} = \frac{234}{5} = 46.8\] At \(D(0, 4)\): \[Z = 6(0) + 9(4) = 36\] Step 5: Compare the values. The maximum value of Z is \(\frac{234}{5}\) i.e., 46.8 at the point \(\left(\frac{18}{5}, \frac{14}{5}\right)\).

Answer: Maximum value of Z = \(\frac{234}{5}\) = 46.8 at \(\left(\frac{18}{5},\, \frac{14}{5}\right)\).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following linear programming problem graphically: Maximize \ \( Z = 5x + 4y \) Subject to constraints: \[ x + y \le 8 \] \[ 3x - 2y + 6 \ge 0 \] \[ x \ge 0, \quad y \ge 0 \]

Solution

  1. Step 1: Identify and rewrite the constraints: The constraints are: (i) \( x + y \le 8 \) (ii) \( 3x - 2y + 6 \ge 0 \), i.e., \( 3x - 2y \ge -6 \), or equivalently \( 2y - 3x \le 6 \) (iii) \( x \ge 0 \) (iv) \( y \ge 0 \)
  2. Step 2: Find the boundary lines: Line 1: \( x + y = 8 \). It passes through \( (8, 0) \) and \( (0, 8) \). Line 2: \( 3x - 2y + 6 = 0 \), i.e., \( 2y = 3x + 6 \). It passes through \( (-2, 0) \) and \( (0, 3) \). The feasible region is bounded by these lines together with the non-negativity constraints.
  3. Step 3: Determine the feasible region: Test the origin \( (0, 0) \) in each constraint: For \( x + y \le 8 \): \( 0 + 0 = 0 \le 8 \). Satisfied. For \( 3x - 2y + 6 \ge 0 \): \( 0 - 0 + 6 = 6 \ge 0 \). Satisfied. So the feasible region is on the side of each line that contains the origin, within the first quadrant.
  4. Step 4: Find the corner points of the feasible region: Corner Point A: Intersection of \( x = 0 \) and \( y = 0 \). So \( A = (0, 0) \). Corner Point B: Intersection of \( x + y = 8 \) and \( x = 0 \). Substituting \( x = 0 \): \( y = 8 \). So \( B = (0, 8) \). Corner Point C: Intersection of \( x + y = 8 \) and \( y = 0 \). Substituting \( y = 0 \): \( x = 8 \). So \( C = (8, 0) \). Corner Point D: Intersection of \( 3x - 2y + 6 = 0 \) and \( y = 0 \). Substituting \( y = 0 \): \( 3x + 6 = 0 \), so \( x = -2 \). This gives \( (-2, 0) \), which lies outside the first quadrant (\( x \ge 0 \)), so it is NOT a valid corner point. Now check whether Line 2 intersects Line 1 within the first quadrant. Solve \( x + y = 8 \) and \( 3x - 2y + 6 = 0 \) simultaneously. From \( x + y = 8 \): \( y = 8 - x \). Substitute into \( 3x - 2y + 6 = 0 \): \[ 3x - 2(8 - x) + 6 = 0 \] \[ 3x - 16 + 2x + 6 = 0 \] \[ 5x - 10 = 0 \] \[ x = 2, \quad y = 6 \] So the intersection point is \( E = (2, 6) \). We must check if this point satisfies all constraints. For \( x \ge 0 \): \( 2 \ge 0 \). For \( y \ge 0 \): \( 6 \ge 0 \). Both satisfied. The corner points of the feasible region are: \( A = (0, 0) \), \( E = (2, 6) \), \( B = (0, 8) \), and \( C = (8, 0) \).
  5. Step 5: Evaluate the objective function at each corner point: The objective function is \( Z = 5x + 4y \). At \( A = (0, 0) \): \[ Z = 5(0) + 4(0) = 0 \] At \( E = (2, 6) \): \[ Z = 5(2) + 4(6) = 10 + 24 = 34 \] At \( B = (0, 8) \): \[ Z = 5(0) + 4(8) = 0 + 32 = 32 \] At \( C = (8, 0) \): \[ Z = 5(8) + 4(0) = 40 + 0 = 40 \]
  6. Step 6: Identify the maximum value: Comparing the values of \( Z \) at all corner points: \( Z(A) = 0 \), \( Z(E) = 34 \), \( Z(B) = 32 \), \( Z(C) = 40 \). The maximum value of \( Z \) is \( 40 \), attained at \( C = (8, 0) \).

Answer: The maximum value of \( Z \) is \( 40 \), attained at the corner point \( (8, 0) \), that is, at \( x = 8 \) and \( y = 0 \).

Everything you get with Solver7

More questions in Linear Programming