SOLVER7 Study. Nothing Else.
Exercise 12.1 Q8

Show that the minimum of \(Z\) occurs at more than two points. \(Minimise\ and\ Maximise\ Z = x + 2y\)
subject to \(x + 2y \ge 100, 2x – y \le 0, 2x + y \le 200; x, y \ge 0.\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are trying to find the cheapest way to mix two ingredients. Sometimes the cheapest mix is not just one recipe — there is a whole range of recipes that cost exactly the same. That is what happens here with the smallest value of \( Z = x + 2y \). Two special corner points, \( (0, 50) \) and \( (20, 40) \), give the same low cost. Every mix in between those two corners costs the same too. So there are infinitely many best answers for the minimum, not just one.

Answer: The maximum value is \( Z = 400 \) at \( (0, 200) \). The minimum value is \( Z = 100 \), attained at \( (0, 50) \), at \( (20, 40) \), and at every point on the line segment joining them (lying on \( x + 2y = 100 \)). Thus the minimum of \( Z \) occurs at more than two points.

📖 Minimum of Z Occurs at More Than Two Points (LPP)

Detailed Explanation

In a Linear Programming Problem (LPP), we optimise (minimise or maximise) a linear objective function subject to linear constraints. The set of all points satisfying every constraint is the feasible region, which is a convex polygon. A key result of LPP is that the optimum of the objective function always occurs at a corner (vertex) of the feasible region. However, a special situation arises when the objective function line is PARALLEL to one of the boundary edges of the feasible region. In that case, the objective function takes the SAME value at both endpoints of that edge, and therefore at EVERY point on that edge. This gives infinitely many optimal solutions, meaning the optimum occurs at more than two points. Here the objective is \( Z = x + 2y \) and one constraint is \( x + 2y \ge 100 \), whose boundary line \( x + 2y = 100 \) is parallel to the objective line, so the minimum repeats along an edge.

Formula Used

Objective function: \( Z = x + 2y \). Corner Point Method: evaluate \( Z \) at each vertex of the feasible region; the smallest value is the minimum and the largest is the maximum. If two adjacent corners give the same optimal value, every point on the edge joining them is also optimal.

Solution

  1. Step 1: List the constraints. We must optimise \( Z = x + 2y \) subject to \[ x + 2y \ge 100 \] \[ 2x - y \le 0 \] \[ 2x + y \le 200 \] \[ x \ge 0, \quad y \ge 0 \]
  2. Step 2: Find the corner points of the feasible region by taking the boundary lines as equalities and solving them in pairs. The relevant boundary lines are \( x + 2y = 100 \), \( 2x - y = 0 \) and \( 2x + y = 200 \), together with the axes.
  3. Step 3: Intersection of \( x + 2y = 100 \) and \( 2x - y = 0 \). From the second line \( y = 2x \). Substitute: \[ x + 2(2x) = 100 \] \[ 5x = 100 \] So \( x = 20 \) and \( y = 40 \). This gives the corner \( (20, 40) \).
  4. Step 4: Intersection of \( 2x - y = 0 \) and \( 2x + y = 200 \). Adding the two equations gives \[ 4x = 200 \] So \( x = 50 \) and then \( y = 2x = 100 \). This gives the corner \( (50, 100) \).
  5. Step 5: Corners on the y-axis (where \( x = 0 \)). Putting \( x = 0 \) in \( x + 2y = 100 \) gives \( y = 50 \), so we get \( (0, 50) \). Putting \( x = 0 \) in \( 2x + y = 200 \) gives \( y = 200 \), so we get \( (0, 200) \). Both lie in the feasible region, so the corner points are \( (0, 50) \), \( (20, 40) \), \( (50, 100) \) and \( (0, 200) \).
  6. Step 6: Evaluate \( Z = x + 2y \) at each corner point. At \( (0, 50) \): \[ Z = 0 + 2(50) = 100 \] At \( (20, 40) \): \[ Z = 20 + 2(40) = 100 \] At \( (50, 100) \): \[ Z = 50 + 2(100) = 250 \] At \( (0, 200) \): \[ Z = 0 + 2(200) = 400 \]
  7. Step 7: Interpret the results. The maximum value of \( Z \) is \( 400 \), occurring at \( (0, 200) \). The minimum value of \( Z \) is \( 100 \), and it occurs at BOTH corners \( (0, 50) \) and \( (20, 40) \). Since these are two adjacent corners giving the same minimum, every point on the line segment joining them is also optimal.
  8. Step 8: Explain why the minimum repeats. The edge joining \( (0, 50) \) and \( (20, 40) \) lies on the line \( x + 2y = 100 \), which is exactly the objective line \( Z = x + 2y \) with value \( 100 \). Because the objective line is parallel to this edge, \( Z = 100 \) at every point on the segment. Hence the minimum occurs at infinitely many points — that is, at more than two points.

Final Answer

The maximum value is \( Z = 400 \) at \( (0, 200) \). The minimum value is \( Z = 100 \), attained at \( (0, 50) \), at \( (20, 40) \), and at every point on the line segment joining them (lying on \( x + 2y = 100 \)). Thus the minimum of \( Z \) occurs at more than two points.

Common Mistake

A common mistake is to stop after finding that \( Z = 100 \) at just the two corner points \( (0, 50) \) and \( (20, 40) \) and conclude the minimum occurs at only two points. Since the objective line is parallel to the edge joining them, the minimum actually occurs at every point on that whole segment, giving infinitely many optimal solutions.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the constraints: We need to optimise \( Z = x + 2y \) subject to the constraints: \[ x + 2y \ge 100 \] \[ 2x - y \le 0 \] \[ 2x + y \le 200 \] \[ x \ge 0, \quad y \ge 0 \] — Reason: Clearly listing every constraint before graphing prevents errors in drawing the feasible region.
  2. Step 2: Convert each constraint boundary to an equation and find key intercepts: Replace each inequality with an equality to get the boundary lines. Line 1: \( x + 2y = 100 \) passes through \( (100, 0) \) and \( (0, 50) \). Line 2: \( 2x - y = 0 \) passes through the origin \( (0, 0) \) and \( (50, 100) \). Line 3: \( 2x + y = 200 \) passes through \( (100, 0) \) and \( (0, 200) \). — Reason: Plotting the boundary lines is the first step to sketching the feasible region accurately.
  3. Step 3: Find the corner points by solving pairs of boundary equations simultaneously: Intersection of Line 2 and Line 1: From \( 2x - y = 0 \) we get \( y = 2x \). Substituting into \( x + 2y = 100 \) gives \( x + 4x = 100 \), so \( x = 20 \) and \( y = 40 \). Corner point: \( (20, 40) \). Intersection of Line 2 and Line 3: Substitute \( y = 2x \) into \( 2x + y = 200 \) to get \( 4x = 200 \), so \( x = 50 \) and \( y = 100 \). Corner point: \( (50, 100) \). Intersection of Line 3 with the y-axis ( \( x = 0 \) ): \( y = 200 \). Corner point: \( (0, 200) \). Intersection of Line 1 with the y-axis ( \( x = 0 \) ): \( y = 50 \). Corner point: \( (0, 50) \). — Reason: The optimal value of \( Z \) can only occur at a vertex of the feasible region, so we must find all vertices.
  4. Step 4: Verify which corner points actually lie in the feasible region: Check \( (0, 50) \): \( 0 + 100 = 100 \ge 100 \) ✓, \( 0 - 50 = -50 \le 0 \) ✓, \( 0 + 50 = 50 \le 200 \) ✓. Check \( (20, 40) \): \( 20 + 80 = 100 \ge 100 \) ✓, \( 40 - 40 = 0 \le 0 \) ✓, \( 40 + 40 = 80 \le 200 \) ✓. Check \( (50, 100) \): \( 50 + 200 = 250 \ge 100 \) ✓, \( 100 - 100 = 0 \le 0 \) ✓, \( 100 + 100 = 200 \le 200 \) ✓. Check \( (0, 200) \): \( 0 + 400 = 400 \ge 100 \) ✓, \( 0 - 200 = -200 \le 0 \) ✓, \( 0 + 200 = 200 \le 200 \) ✓. All four vertices are valid. — Reason: A candidate vertex must satisfy every constraint; any that does not must be discarded.
  5. Step 5: Evaluate the objective function at each corner point: At \( (0, 50) \): \( Z = 0 + 2(50) = 100 \). At \( (20, 40) \): \( Z = 20 + 2(40) = 100 \). At \( (50, 100) \): \( Z = 50 + 2(100) = 250 \). At \( (0, 200) \): \( Z = 0 + 2(200) = 400 \). — Reason: The Corner Point Method guarantees that the global optimum is among these values.
  6. Step 6: Identify the maximum and minimum, and check for infinitely many solutions: The largest value of \( Z \) is \( 400 \), occurring at \( (0, 200) \). The smallest value of \( Z \) is \( 100 \), occurring at both \( (0, 50) \) and \( (20, 40) \). Notice that the objective function \( Z = x + 2y \) has the same coefficient structure as the constraint \( x + 2y = 100 \), meaning the objective function line is parallel to the edge connecting \( (0, 50) \) and \( (20, 40) \). Therefore, \( Z = 100 \) at every point on the segment joining \( (0, 50) \) and \( (20, 40) \). — Reason: When two adjacent vertices give the same optimal value and the objective line is parallel to that edge, every point on the edge is also optimal, giving infinitely many minimum solutions.

Final Answer

The maximum value is \( Z = 400 \) at \( (0, 200) \). The minimum value is \( Z = 100 \), attained at \( (0, 50) \), at \( (20, 40) \), and at every point on the line segment joining them (lying on \( x + 2y = 100 \)). Thus the minimum of \( Z \) occurs at more than two points.

Common Mistake

One common mistake: students identify only one vertex as the minimum when two adjacent vertices give the same value of \( Z \); they must recognise that because the objective function line is parallel to that edge, every point on the segment between those two vertices is also a minimum — giving infinitely many optimal solutions, not just one.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner Points: Solving boundary lines simultaneously gives vertices: \( (0, 50) \), \( (20, 40) \), \( (0, 200) \), \( (100, 0) \) — verify each satisfies all constraints to identify the feasible region corners.
  2. Step 2: Evaluate Z at Each Vertex: At \( (0, 50) \): \( Z = 0 + 2(50) = 100 \). At \( (20, 40) \): \( Z = 20 + 2(40) = 100 \). At \( (0, 200) \): \( Z = 0 + 2(200) = 400 \).
  3. Step 3: Identify Optimal Values: Since \( Z = 100 \) at both \( (0, 50) \) and \( (20, 40) \), and these lie on \( x + 2y = 100 \) which is parallel to the objective function line, every point on the segment joining them also gives \( Z = 100 \).

Answer: The maximum value is \( Z = 400 \) at \( (0, 200) \). The minimum value is \( Z = 100 \), attained at \( (0, 50) \), at \( (20, 40) \), and at every point on the line segment joining them (lying on \( x + 2y = 100 \)). Thus the minimum of \( Z \) occurs at more than two points.

➕ More Examples

More Examples

Example 1

Question: Minimise and Maximise \( Z = 2x + 4y \) subject to the constraints \( x + 2y \ge 80 \), \( 3x - y \le 0 \), \( x + y \le 120 \), \( x, y \ge 0 \). Also show that the minimum of Z occurs at more than two points.

Solution: Step 1: Identify the constraints and find the feasible region. The constraints are: \[ x + 2y \ge 80 \] \[ 3x - y \le 0 \quad \Rightarrow \quad y \ge 3x \] \[ x + y \le 120 \] \[ x \ge 0, \quad y \ge 0 \] Step 2: Find the corner points of the feasible region. Find intersection of \( x + 2y = 80 \) and \( y = 3x \): Substitute \( y = 3x \) into \( x + 2(3x) = 80 \): \[ x + 6x = 80 \Rightarrow 7x = 80 \Rightarrow x = \frac{80}{7}, \quad y = \frac{240}{7} \] So point A = \( \left(\frac{80}{7}, \frac{240}{7}\right) \). Find intersection of \( y = 3x \) and \( x + y = 120 \): Substitute \( y = 3x \) into \( x + 3x = 120 \): \[ 4x = 120 \Rightarrow x = 30, \quad y = 90 \] So point B = \( (30, 90) \). Find intersection of \( x + y = 120 \) and \( x + 2y = 80 \): Subtracting: \( (x + 2y) - (x + y) = 80 - 120 \Rightarrow y = -40 \), which is negative. So these two lines do not intersect inside the feasible region. Check \( x = 0 \) with \( x + 2y = 80 \): \( y = 40 \). Point C = \( (0, 40) \). Check \( x = 0 \) with \( x + y = 120 \): \( y = 120 \). Point D = \( (0, 120) \). So the corner points of the feasible region are: \[ A = \left(\frac{80}{7}, \frac{240}{7}\right), \quad B = (30, 90), \quad D = (0, 120), \quad C = (0, 40) \] Step 3: Evaluate \( Z = 2x + 4y \) at each corner point. At C = \( (0, 40) \): \[ Z = 2(0) + 4(40) = 160 \] At A = \( \left(\frac{80}{7}, \frac{240}{7}\right) \): \[ Z = 2 \cdot \frac{80}{7} + 4 \cdot \frac{240}{7} = \frac{160}{7} + \frac{960}{7} = \frac{1120}{7} = 160 \] At B = \( (30, 90) \): \[ Z = 2(30) + 4(90) = 60 + 360 = 420 \] At D = \( (0, 120) \): \[ Z = 2(0) + 4(120) = 480 \] Step 4: Identify minimum and maximum. Minimum value of Z = 160, achieved at both C = \( (0, 40) \) and A = \( \left(\frac{80}{7}, \frac{240}{7}\right) \). Since Z takes the same minimum value at two adjacent corner points C and A, it attains the minimum at every point on the line segment CA. This shows the minimum occurs at more than two points (infinitely many points on segment CA). Maximum value of Z = 480, achieved at D = \( (0, 120) \). Step 5: Verify the minimum occurs at more than two points. The segment CA lies on the line \( x + 2y = 80 \). Along this segment, \( Z = 2x + 4y = 2(x + 2y) = 2 \times 80 = 160 \), which is constant. Hence minimum Z = 160 at every point of segment CA.

Answer: Minimum value of Z = 160 (attained at every point on the segment joining \( (0,40) \) and \( \left(\frac{80}{7}, \frac{240}{7}\right) \)); Maximum value of Z = 480 at \( (0, 120) \).

Example 2

Question: Minimise and Maximise \( Z = 3x + 6y \) subject to \( x + 2y \ge 60 \), \( 2x - y \le 0 \), \( x + y \le 90 \), \( x, y \ge 0 \). Show that the minimum of Z occurs at more than two points.

Solution: Step 1: Write the constraints. \[ x + 2y \ge 60 \] \[ 2x - y \le 0 \quad \Rightarrow \quad y \ge 2x \] \[ x + y \le 90 \] \[ x \ge 0, \quad y \ge 0 \] Step 2: Find corner points of the feasible region. Intersection of \( y = 2x \) and \( x + 2y = 60 \): Substitute \( y = 2x \): \[ x + 4x = 60 \Rightarrow 5x = 60 \Rightarrow x = 12, \quad y = 24 \] Point A = \( (12, 24) \). Intersection of \( y = 2x \) and \( x + y = 90 \): Substitute \( y = 2x \): \[ x + 2x = 90 \Rightarrow 3x = 90 \Rightarrow x = 30, \quad y = 60 \] Point B = \( (30, 60) \). At \( x = 0 \) on \( x + 2y = 60 \): \( y = 30 \). Point C = \( (0, 30) \). At \( x = 0 \) on \( x + y = 90 \): \( y = 90 \). Point D = \( (0, 90) \). Check whether C = \( (0, 30) \) satisfies \( y \ge 2x \): \( 30 \ge 0 \). Yes. So the corner points are: C = \( (0, 30) \), A = \( (12, 24) \), B = \( (30, 60) \), D = \( (0, 90) \). Step 3: Evaluate \( Z = 3x + 6y \) at each corner point. At C = \( (0, 30) \): \[ Z = 3(0) + 6(30) = 180 \] At A = \( (12, 24) \): \[ Z = 3(12) + 6(24) = 36 + 144 = 180 \] At B = \( (30, 60) \): \[ Z = 3(30) + 6(60) = 90 + 360 = 450 \] At D = \( (0, 90) \): \[ Z = 3(0) + 6(90) = 540 \] Step 4: Identify minimum and maximum. Minimum value of Z = 180, attained at both C = \( (0, 30) \) and A = \( (12, 24) \). Maximum value of Z = 540, attained at D = \( (0, 90) \). Step 5: Show minimum occurs at more than two points. Observe that \( Z = 3x + 6y = 3(x + 2y) \). Along the segment CA, both points satisfy \( x + 2y = 60 \), so \( Z = 3 \times 60 = 180 \) at every point on segment CA. Therefore, Z attains the minimum value of 180 at infinitely many points — every point on the line segment joining C = \( (0, 30) \) and A = \( (12, 24) \).

Answer: Minimum value of Z = 180 (at every point on the segment joining \( (0,30) \) and \( (12,24) \)); Maximum value of Z = 540 at \( (0, 90) \).

🎯 Try a Similar Question

Try a Similar Question

Question: Minimise and Maximise \ \( Z = 2x + 3y \) \\ subject to the constraints: \\ \( x + 3y \ge 60 \), \( 3x - y \le 0 \), \( 3x + y \le 180 \), \( x \ge 0 \), \( y \ge 0 \). \\ Also show that the minimum of \( Z \) occurs at more than two points.

Solution

  1. Step 1: Write the constraints as equations to find boundary lines: The boundary lines are: Line 1: \( x + 3y = 60 \) Line 2: \( 3x - y = 0 \), i.e., \( y = 3x \) Line 3: \( 3x + y = 180 \) Also \( x = 0 \) and \( y = 0 \).
  2. Step 2: Find the corner points of the feasible region: Intersection of Line 1 and the y-axis (\( x = 0 \)): \( 3y = 60 \Rightarrow y = 20 \). So point \( A = (0, 20) \). Intersection of Line 1 and Line 2: Substitute \( y = 3x \) into \( x + 3y = 60 \): \( x + 9x = 60 \Rightarrow 10x = 60 \Rightarrow x = 6 \), \( y = 18 \). So point \( B = (6, 18) \). Intersection of Line 2 and Line 3: Substitute \( y = 3x \) into \( 3x + y = 180 \): \( 3x + 3x = 180 \Rightarrow 6x = 180 \Rightarrow x = 30 \), \( y = 90 \). So point \( C = (30, 90) \). Intersection of Line 3 and the y-axis (\( x = 0 \)): \( y = 180 \). So point \( D = (0, 180) \).
  3. Step 3: Verify feasibility of each corner point: Check \( A = (0, 20) \): \( x + 3y = 60 \ge 60 \) ✓; \( 3x - y = -20 \le 0 \) ✓; \( 3x + y = 20 \le 180 \) ✓. Check \( B = (6, 18) \): \( x + 3y = 60 \ge 60 \) ✓; \( 3x - y = 0 \le 0 \) ✓; \( 3x + y = 36 \le 180 \) ✓. Check \( C = (30, 90) \): \( x + 3y = 300 \ge 60 \) ✓; \( 3x - y = 0 \le 0 \) ✓; \( 3x + y = 180 \le 180 \) ✓. Check \( D = (0, 180) \): \( x + 3y = 540 \ge 60 \) ✓; \( 3x - y = -180 \le 0 \) ✓; \( 3x + y = 180 \le 180 \) ✓. All four points are feasible.
  4. Step 4: Evaluate the objective function Z = 2x + 3y at each corner point: At \( A = (0, 20) \): \( Z = 2(0) + 3(20) = 60 \). At \( B = (6, 18) \): \( Z = 2(6) + 3(18) = 12 + 54 = 66 \). At \( C = (30, 90) \): \( Z = 2(30) + 3(90) = 60 + 270 = 330 \). At \( D = (0, 180) \): \( Z = 2(0) + 3(180) = 540 \).
  5. Step 5: Identify maximum and minimum values: From the table of values: Minimum \( Z = 60 \) at \( A = (0, 20) \). Maximum \( Z = 540 \) at \( D = (0, 180) \).
  6. Step 6: Show that the minimum occurs at more than two points: The minimum value \( Z = 60 \) is attained at \( A = (0, 20) \). Now check whether the objective function \( Z = 2x + 3y = 60 \) coincides with the boundary constraint \( x + 3y = 60 \) along the edge \( AB \). Note that \( Z = 2x + 3y \) and the constraint line is \( x + 3y = 60 \). These are NOT identical (the coefficients of \( x \) differ: 2 vs 1), so \( Z \) is NOT constant along \( AB \). However, observe that at \( A = (0, 20) \) we get \( Z = 60 \). Check a general point on the segment \( AB \) on line \( x + 3y = 60 \): any point \( (t, \frac{60-t}{3}) \) for \( 0 \le t \le 6 \) gives \[ Z = 2t + 3 \cdot \frac{60-t}{3} = 2t + 60 - t = 60 + t \] So \( Z = 60 + t \ge 60 \), with equality only when \( t = 0 \), i.e., only at point \( A \). Therefore, the minimum does NOT occur along the entire segment \( AB \). Let us re-examine the feasible region. Actually, consider whether any other boundary yields \( Z = 60 \). The constraint \( x + 3y \ge 60 \) with \( Z = 2x + 3y \): on the boundary \( x + 3y = 60 \), we showed \( Z = 60 + t \ge 60 \). The minimum \( Z = 60 \) is achieved uniquely at \( A = (0, 20) \) among all feasible points. Hence, the minimum value of \( Z \) is \( 60 \) attained only at \( A = (0, 20) \), and the maximum value is \( 540 \) attained at \( D = (0, 180) \). Note for the minimum: since \( Z = 60 + t \) on the constraint boundary, \( Z \) strictly increases as \( t \) increases, confirming the unique minimum at \( (0,20) \).
  7. Step 7: Conclusion: The minimum value of \( Z = 2x + 3y \) is \( 60 \), attained at the unique point \( (0, 20) \). The maximum value of \( Z = 2x + 3y \) is \( 540 \), attained at the point \( (0, 180) \).

Answer: The minimum value of \( Z \) is \( 60 \), attained at \( (0, 20) \). The maximum value of \( Z \) is \( 540 \), attained at \( (0, 180) \).

Everything you get with Solver7

More questions in Linear Programming