SOLVER7 Study. Nothing Else.
2026 Board Paper Q15

In an \(LPP,\) if the objective function has the same minimum value on two corner points of the feasible region, then the number of points at which the minimum value of objective function occurs is : (A)\(0\) (B)\(2\) (C)Infinite (D)Finite

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine a treasure hunt where two spots on a map both hold the same prize. Any spot on the path between those two spots also holds that same prize. In maths, when we try to find the smallest value of a rule like Z = ax + by, sometimes two corner points both give the smallest answer. Every point between those two corners also gives the same smallest answer. Since a line segment has countless points on it, the answer repeats at infinitely many places.

Answer: Option (C) Infinite. The minimum value of the objective function occurs at infinitely many points (every point on the segment joining the two corner points).

📖 Minimum Value on Two Corner Points

Detailed Explanation

In a Linear Programming Problem (LPP), the objective function is of the form \( Z = ax + by \), and it is optimized (maximized or minimized) over a feasible region. A key result from the Corner Point Method states that the optimal value of \( Z \) always occurs at a corner (vertex) of the feasible region. However, sometimes the SAME optimal value is attained at TWO adjacent corner points. When this happens, the optimal value is not restricted to just those two corners — it also occurs at every point lying on the line segment that joins these two corner points. Since a line segment contains infinitely many points, the objective function attains that same optimal value at infinitely many points. This situation is called an LPP having multiple (or infinite) optimal solutions.

Formula Used

Objective function: \( Z = ax + by \). Corner Point Theorem: The optimal value of \( Z \) occurs at a corner point of the feasible region; if it occurs at two corner points, it occurs at every point on the segment joining them.

Solution

  1. Step 1: Recall the Corner Point Method. For an objective function \( Z = ax + by \), we evaluate \( Z \) at each corner point of the feasible region and compare the values to find the minimum.
  2. Step 2: Suppose the minimum value of \( Z \) is the same at two corner points, say \( P \) and \( Q \). Let this common minimum value be \( m \), so \( Z(P) = Z(Q) = m \).
  3. Step 3: Consider any point \( R \) lying on the line segment joining \( P \) and \( Q \). Such a point can be written as \( R = tP + (1-t)Q \) where \( 0 \le t \le 1 \). Because \( Z \) is a linear function, \( Z(R) = tZ(P) + (1-t)Z(Q) = tm + (1-t)m = m \).
  4. Step 4: This shows every point \( R \) on the segment \( PQ \) also gives \( Z = m \), the same minimum value. Since a line segment contains infinitely many points, the minimum value is achieved at infinitely many points.
  5. Step 5: Hence the LPP has infinitely many optimal (minimum) solutions, all lying on the segment joining the two corner points.

Final Answer

Option (C) Infinite. The minimum value of the objective function occurs at infinitely many points (every point on the segment joining the two corner points).

Common Mistake

A common mistake is choosing option (B) \( 2 \), thinking the minimum occurs only at the two given corner points. Students forget that because \( Z \) is linear, every point on the line segment joining those two corners also gives the same value, producing infinitely many optimal points.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Recall the Corner Point Method: for an objective function \( Z = ax + by \), calculate the value of \( Z \) at every vertex (corner point) of the feasible region and compare — Reason: The Corner Point Theorem guarantees that the optimal value of a linear objective function over a convex feasible region must occur at one or more of its corner points.
  2. Step 2: Suppose, after evaluating, two adjacent corner points \( P \) and \( Q \) both give the same minimum value \( m \), so \( Z(P) = m \) and \( Z(Q) = m \) — Reason: This is the key scenario we are investigating; the minimum is not unique to a single vertex but is shared by two vertices.
  3. Step 3: Pick any point \( R \) on the line segment joining \( P \) and \( Q \). By the section formula, \( R \) can be written as \( R = (1 - t)P + tQ \) for some \( t \) with \( 0 \le t \le 1 \) — Reason: Every interior point of a segment between two points in a convex set is a convex combination of those two points, and the feasible region is convex, so \( R \) is also feasible.
  4. Step 4: Compute \( Z(R) \) using linearity: \[ Z(R) = (1-t)\,Z(P) + t\,Z(Q) = (1-t)\,m + t\,m = m \] — Reason: Because \( Z \) is a linear function, it distributes over convex combinations, so \( Z(R) \) equals the same weighted average of \( Z(P) \) and \( Z(Q) \), both of which equal \( m \).
  5. Step 5: Since \( t \) can be any value in \( [0, 1] \), there are infinitely many choices for \( R \), and each gives \( Z(R) = m \) — Reason: A continuous parameter \( t \) ranging over an interval \( [0, 1] \) produces uncountably many distinct points, all yielding the same minimum value.
  6. Step 6: Conclude: the minimum value \( m \) of the objective function is attained not just at two points, but at infinitely many points — every point on segment \( PQ \) — Reason: This is the definition of an LPP having multiple (infinite) optimal solutions, and it directly corresponds to Option (C).

Final Answer

Option (C) Infinite. The minimum value of the objective function occurs at infinitely many points (every point on the segment joining the two corner points).

Common Mistake

One common mistake: students assume the optimal value occurs at only the two corner points and forget that every point on the segment between them is also feasible and also achieves the same optimal value, leading them to incorrectly answer 'two' instead of 'infinite'.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Evaluate \( Z \) at each corner point of the feasible region using the Corner Point Method.
  2. Step 2: If the minimum value \( m \) is attained at two corner points \( P \) and \( Q \), then \( Z(P) = Z(Q) = m \).
  3. Step 3: Every point \( R \) on segment \( PQ \) can be written as \( R = (1-t)P + tQ \) for \( t \in [0,1] \), giving \( Z(R) = (1-t)Z(P) + tZ(Q) = m \). Since infinitely many such points \( R \) exist, the minimum is attained at infinitely many points.

Answer: Option (C) Infinite. The minimum value of the objective function occurs at infinitely many points (every point on the segment joining the two corner points).

➕ More Examples

More Examples

Example 1

Question: In a Linear Programming Problem, the objective function \( Z = 3x + 4y \) is to be maximised over a feasible region. After evaluating Z at all corner points, it is found that Z attains its maximum value of 24 at two distinct corner points \( A(8, 0) \) and \( B(4, 3) \). How many points in the feasible region give this maximum value? Choose the correct option: (A) Exactly 1 (B) Exactly 2 (C) Infinitely many (D) None

Solution: We are told the maximum value of \( Z = 3x + 4y \) is 24, and it is attained at two distinct corner points \( A(8, 0) \) and \( B(4, 3) \). Verification at A: \( Z = 3(8) + 4(0) = 24 \). Correct. Verification at B: \( Z = 3(4) + 4(3) = 12 + 12 = 24 \). Correct. Now consider any point on the line segment joining A and B. A general point on segment AB is: \[ R = (1-t)\,A + t\,B = \bigl((1-t)(8) + t(4),\; (1-t)(0) + t(3)\bigr) \] for \( t \in [0, 1] \). This gives \( R = (8 - 4t,\; 3t) \). The value of Z at R is: \[ Z(R) = 3(8 - 4t) + 4(3t) = 24 - 12t + 12t = 24 \] Since \( t \) can take any value in the closed interval \( [0, 1] \), there are infinitely many such points R, all giving Z = 24. By the convexity of the feasible region, the entire segment AB lies within the feasible region, so all these points are feasible. Hence, the maximum value of Z is attained at infinitely many points. The answer is (C) Infinitely many.

Answer: (C) Infinitely many

Example 2

Question: In an LPP, the objective function \( Z = 5x + 2y \) is to be minimised. The feasible region is a polygon with corner points \( P(0, 10) \), \( Q(2, 5) \), \( R(6, 3) \), and \( S(10, 0) \). If the minimum value of Z occurs at two of these corner points, identify those points and state how many points in the feasible region give the minimum value.

Solution: First, evaluate \( Z = 5x + 2y \) at each corner point. At \( P(0, 10) \): \( Z = 5(0) + 2(10) = 20 \) At \( Q(2, 5) \): \( Z = 5(2) + 2(5) = 10 + 10 = 20 \) At \( R(6, 3) \): \( Z = 5(6) + 2(3) = 30 + 6 = 36 \) At \( S(10, 0) \): \( Z = 5(10) + 2(0) = 50 \) The minimum value of Z is 20, attained at both \( P(0, 10) \) and \( Q(2, 5) \). Now consider any point on the segment PQ. A general point on PQ is: \[ T = (1-t)\,P + t\,Q = \bigl((1-t)(0) + t(2),\; (1-t)(10) + t(5)\bigr) \] for \( t \in [0, 1] \). This gives \( T = (2t,\; 10 - 5t) \). The value of Z at T is: \[ Z(T) = 5(2t) + 2(10 - 5t) = 10t + 20 - 10t = 20 \] Since the result is 20 for every \( t \in [0, 1] \), the minimum value is attained at every point on the segment PQ. Because the feasible region is convex, the segment PQ lies entirely within it, so all these points are feasible. The minimum value of Z occurs at infinitely many points (every point on the line segment joining \( P(0,10) \) and \( Q(2,5) \)).

Answer: The minimum value of Z is 20, occurring at both P(0, 10) and Q(2, 5), and hence at infinitely many points on segment PQ.

🎯 Try a Similar Question

Try a Similar Question

Question: In a Linear Programming Problem (LPP), the feasible region is a bounded polygon with corner points \( A(0, 0) \), \( B(4, 0) \), \( C(3, 2) \), and \( D(0, 3) \). The objective function is \( Z = 5x + 4y \). If the maximum value of \( Z \) occurs at only one corner point of the feasible region, then the number of points at which the maximum value of the objective function occurs is: (A) 0 (B) 1 (C) 2 (D) Infinite

Solution

  1. Step 1: Recall the Corner Point Method: According to the Corner Point Method in LPP, the optimal value of the objective function occurs at one of the corner (vertex) points of the feasible region. We evaluate \( Z = 5x + 4y \) at each corner point.
  2. Step 2: Evaluate Z at each corner point: At \( A(0, 0) \): \( Z = 5(0) + 4(0) = 0 \) At \( B(4, 0) \): \( Z = 5(4) + 4(0) = 20 \) At \( C(3, 2) \): \( Z = 5(3) + 4(2) = 15 + 8 = 23 \) At \( D(0, 3) \): \( Z = 5(0) + 4(3) = 12 \)
  3. Step 3: Identify the maximum value: Comparing all values: \( Z = 0,\ 20,\ 23,\ 12 \), the maximum value is \( Z = 23 \), which occurs only at the corner point \( C(3, 2) \).
  4. Step 4: Determine the number of optimal points: Since the maximum value \( Z = 23 \) is attained at exactly one corner point \( C(3, 2) \) and at no other corner point, there is no segment joining two corners with equal maximum value. Therefore, the maximum occurs at exactly one unique point in the feasible region.
  5. Step 5: Conclusion: When the optimal value of an objective function in an LPP is attained at only one corner point of the feasible region, the number of points at which the optimal value occurs is exactly \( 1 \). The correct answer is Option (B).

Answer: Option (B) 1. Since the maximum value of \( Z = 5x + 4y \) occurs at only one corner point \( C(3,2) \), the maximum is attained at exactly one point in the feasible region.

Everything you get with Solver7

More questions in Linear Programming