SOLVER7 Study. Nothing Else.
2026 Board Paper Q15

The corner points of the feasible region determined by the system of linear constraints are \((0, 0), (0, 40), (20, 40) (60, 20)\) and \((60, 0).\) If the objective function of an \(LPP\) is \(Z = 4x + 3y,\) then the maximum value is : (A)\(200 \) (B)\(300\) (C)\(240\) (D)\(120\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are treasure hunting and there is a special map with a shaded region. The treasure can only be found at one of the corner spots on that map. To find the biggest treasure, you check each corner and count the coins there. The corner giving the most coins wins! Here, our corners are five special points, and we check a score at each one. The corner \( (60, 20) \) gives the highest score of \( 300 \), so that is where the biggest treasure lies.

Answer: The maximum value of \( Z = 4x + 3y \) is \( 300 \), occurring at the corner point \( (60, 20) \). Correct option: (B) 300.

📖 Maximum Value of Objective Function at Corner Points

Detailed Explanation

In Linear Programming, the feasible region is the set of all points that satisfy the given constraints. A very important result called the Corner Point Theorem states that the optimum value (maximum or minimum) of the objective function, if it exists, always occurs at one of the corner points (vertices) of the feasible region. So instead of checking every point inside the region, we only need to evaluate the objective function \( Z = 4x + 3y \) at each corner point and then compare the values. The largest value gives the maximum, and the smallest value gives the minimum.

Formula Used

Objective function: \( Z = 4x + 3y \). Evaluate \( Z \) at each corner point and pick the greatest value for the maximum.

Solution

  1. Step 1: List the corner points of the feasible region: \( (0, 0) \), \( (0, 40) \), \( (20, 40) \), \( (60, 20) \), and \( (60, 0) \). By the Corner Point Theorem, the maximum of \( Z \) must occur at one of these points.
  2. Step 2: Evaluate \( Z = 4x + 3y \) at \( (0, 0) \): \[ Z = 4(0) + 3(0) = 0 \]
  3. Step 3: Evaluate \( Z \) at \( (0, 40) \): \[ Z = 4(0) + 3(40) = 120 \]
  4. Step 4: Evaluate \( Z \) at \( (20, 40) \): \[ Z = 4(20) + 3(40) = 80 + 120 = 200 \]
  5. Step 5: Evaluate \( Z \) at \( (60, 20) \): \[ Z = 4(60) + 3(20) = 240 + 60 = 300 \]
  6. Step 6: Evaluate \( Z \) at \( (60, 0) \): \[ Z = 4(60) + 3(0) = 240 \]
  7. Step 7: Compare all the values: \( 0, 120, 200, 300, 240 \). The largest value is \( 300 \), which occurs at the point \( (60, 20) \). Hence the maximum value of \( Z \) is \( 300 \).

Final Answer

The maximum value of \( Z = 4x + 3y \) is \( 300 \), occurring at the corner point \( (60, 20) \). Correct option: (B) 300.

Common Mistake

A common mistake is to stop after computing \( Z = 240 \) at \( (60, 0) \) and pick option (C), or to check only a few corner points. You must evaluate \( Z \) at every corner point and then compare, since the maximum can occur at any vertex.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the corner points of the feasible region: \( (0, 0) \), \( (0, 40) \), \( (20, 40) \), \( (60, 20) \), and \( (60, 0) \). — Reason: By the Corner Point Theorem, the maximum of any linear objective function over a bounded feasible region must occur at one of these vertices, so there is no need to test interior points.
  2. Step 2: Compute \( Z \) at \( (0, 0) \): \[ Z = 4(0) + 3(0) = 0 \] — Reason: Starting with the origin is a natural baseline and confirms the function is not negative at this boundary point.
  3. Step 3: Compute \( Z \) at \( (0, 40) \): \[ Z = 4(0) + 3(40) = 120 \] — Reason: Testing this vertex covers the portion of the boundary where \( x = 0 \) and \( y \) is at its highest allowed value along that edge.
  4. Step 4: Compute \( Z \) at \( (20, 40) \): \[ Z = 4(20) + 3(40) = 80 + 120 = 200 \] — Reason: This interior vertex is formed by the intersection of two constraint boundaries and must be checked, as it often yields higher values than purely axis-based corners.
  5. Step 5: Compute \( Z \) at \( (60, 20) \): \[ Z = 4(60) + 3(20) = 240 + 60 = 300 \] — Reason: This vertex lies deep into the positive \( x \)-direction, and since the coefficient of \( x \) in \( Z \) is larger than that of \( y \), we expect a high value here.
  6. Step 6: Compute \( Z \) at \( (60, 0) \): \[ Z = 4(60) + 3(0) = 240 \] — Reason: Checking this last vertex ensures no corner is overlooked before drawing a conclusion.
  7. Step 7: Arrange all computed values for comparison: at \( (0,0) \) we get \( 0 \), at \( (0,40) \) we get \( 120 \), at \( (20,40) \) we get \( 200 \), at \( (60,20) \) we get \( 300 \), and at \( (60,0) \) we get \( 240 \). The greatest among these is \( 300 \), achieved at \( (60, 20) \). — Reason: Direct comparison of all corner-point values is the final step dictated by the Corner Point Theorem; the largest value is the maximum of \( Z \).

Final Answer

The maximum value of \( Z = 4x + 3y \) is \( 300 \), occurring at the corner point \( (60, 20) \). Correct option: (B) 300.

Common Mistake

One common mistake: Students sometimes skip one or more corner points (often the origin or an axis-intercept vertex) and incorrectly declare a smaller value as the maximum — always evaluate Z at every listed corner point before concluding.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points and corresponding \( Z \) values:
  2. Step 2: \[\begin{aligned} (0,0): & \quad Z = 4(0)+3(0) = 0 \\ (0,40): & \quad Z = 4(0)+3(40) = 120 \\ (20,40): & \quad Z = 4(20)+3(40) = 200 \\ (60,20): & \quad Z = 4(60)+3(20) = 300 \\ (60,0): & \quad Z = 4(60)+3(0) = 240 \end{aligned}\]
  3. Step 3: Maximum value is \( Z = 300 \) at \( (60, 20) \).

Answer: The maximum value of \( Z = 4x + 3y \) is \( 300 \), occurring at the corner point \( (60, 20) \). Correct option: (B) 300.

➕ More Examples

More Examples

Example 1

Question: The corner points of the feasible region of an LPP are \( (0, 0) \), \( (0, 50) \), \( (30, 50) \), \( (70, 10) \), and \( (70, 0) \). If the objective function is \( Z = 5x + 2y \), find the maximum value of \( Z \). (A) 360 (B) 370 (C) 100 (D) 150

Solution: We evaluate the objective function \( Z = 5x + 2y \) at each corner point of the feasible region. At \( (0, 0) \): \[ Z = 5(0) + 2(0) = 0 \] At \( (0, 50) \): \[ Z = 5(0) + 2(50) = 100 \] At \( (30, 50) \): \[ Z = 5(30) + 2(50) = 150 + 100 = 250 \] At \( (70, 10) \): \[ Z = 5(70) + 2(10) = 350 + 20 = 370 \] At \( (70, 0) \): \[ Z = 5(70) + 2(0) = 350 \] Comparing all values: \( 0, 100, 250, 370, 350 \). The maximum value of \( Z \) is \( 370 \), occurring at the corner point \( (70, 10) \).

Answer: (B) 370

Example 2

Question: The corner points of the feasible region determined by a system of linear constraints are \( (0, 0) \), \( (0, 30) \), \( (10, 30) \), \( (40, 15) \), and \( (40, 0) \). The objective function of an LPP is \( Z = 6x + 4y \). What is the maximum value of \( Z \)? (A) 180 (B) 120 (C) 300 (D) 300

Solution: We evaluate the objective function \( Z = 6x + 4y \) at each corner point of the feasible region. At \( (0, 0) \): \[ Z = 6(0) + 4(0) = 0 \] At \( (0, 30) \): \[ Z = 6(0) + 4(30) = 120 \] At \( (10, 30) \): \[ Z = 6(10) + 4(30) = 60 + 120 = 180 \] At \( (40, 15) \): \[ Z = 6(40) + 4(15) = 240 + 60 = 300 \] At \( (40, 0) \): \[ Z = 6(40) + 4(0) = 240 \] Comparing all values: \( 0, 120, 180, 300, 240 \). The maximum value of \( Z \) is \( 300 \), occurring at the corner point \( (40, 15) \).

Answer: (C) or (D) 300

🎯 Try a Similar Question

Try a Similar Question

Question: The corner points of the feasible region determined by a system of linear constraints are \( (0, 0) \), \( (0, 50) \), \( (30, 50) \), \( (50, 30) \), and \( (50, 0) \). The objective function of an LPP is \( Z = 5x + 2y \). Find the maximum value of \( Z \). (A) 200 (B) 250 (C) 310 (D) 350

Solution

  1. Step 1: List the Corner Points: The corner points of the feasible region are: \( (0, 0) \), \( (0, 50) \), \( (30, 50) \), \( (50, 30) \), and \( (50, 0) \).
  2. Step 2: Evaluate Z at Each Corner Point: The objective function is \( Z = 5x + 2y \). Evaluate at each corner point: At \( (0, 0) \): \[ Z = 5(0) + 2(0) = 0 \] At \( (0, 50) \): \[ Z = 5(0) + 2(50) = 100 \] At \( (30, 50) \): \[ Z = 5(30) + 2(50) = 150 + 100 = 250 \] At \( (50, 30) \): \[ Z = 5(50) + 2(30) = 250 + 60 = 310 \] At \( (50, 0) \): \[ Z = 5(50) + 2(0) = 250 \]
  3. Step 3: Compare All Values: The values of \( Z \) at the corner points are \( 0 \), \( 100 \), \( 250 \), \( 310 \), and \( 250 \). The largest value is \( 310 \), occurring at the corner point \( (50, 30) \).
  4. Step 4: State the Maximum: Therefore, the maximum value of \( Z = 5x + 2y \) is \( 310 \), attained at \( (50, 30) \). The correct option is (C) 310.

Answer: The maximum value of \( Z = 5x + 2y \) is \( 310 \), occurring at the corner point \( (50, 30) \). Correct option: (C) 310.

Everything you get with Solver7

More questions in Linear Programming