SOLVER7 Study. Nothing Else.
Exercise 12.1 Q7

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

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are choosing how many toys to pack in two boxes to keep the cost as low or as high as possible. There are rules about how many toys each box can hold. You try every allowed corner arrangement and check the total cost each time. Sometimes two different arrangements give the exact same highest cost. When that happens, every mix between those two arrangements also gives the same highest cost. Here the lowest cost is \(300\) and the highest cost is \(600\), reached at more than one arrangement.

Answer: Minimum value of \(Z\) is \(300\) at the point \((60, 0)\). Maximum value of \(Z\) is \(600\), and it occurs at both \((120, 0)\) and \((60, 30)\); therefore \(Z = 600\) at every point on the line segment joining these two vertices, i.e. at more than two points.

📖 Minimising and Maximising Z = 5x + 10y with Multiple Optimal Points

Detailed Explanation

In a Linear Programming Problem (LPP), we optimise (maximise or minimise) a linear objective function subject to linear constraints. The set of all points satisfying the constraints is called the feasible region. By the Corner Point Theorem, if an optimal value of the objective function exists, it occurs at a corner point (vertex) of the feasible region. To solve, we plot the constraints, find the corner points, and evaluate \(Z\) at each. An important special case arises when two adjacent corner points give the SAME optimal value of \(Z\). When this happens, every point on the line segment joining those two corners also gives that same optimal value. This means the minimum (or maximum) occurs not just at those two vertices, but at infinitely many points along that edge.

Formula Used

Objective function: \(Z = 5x + 10y\). Corner Point Method: evaluate \(Z\) at each vertex of the feasible region; the smallest value is the minimum and the largest value is the maximum. If two corner points give equal optimal \(Z\), every point on the segment joining them is also optimal.

Solution

  1. Step 1: Write the constraints: We minimise and maximise \(Z = 5x + 10y\) subject to \(x + 2y \le 120\), \(x + y \ge 60\), \(x - 2y \ge 0\), and \(x, y \ge 0\).
  2. Step 2: Convert inequalities to boundary lines: Treat each constraint as an equation to draw its boundary line: \(x + 2y = 120\), \(x + y = 60\), and \(x - 2y = 0\). These lines, together with the axes \(x = 0\) and \(y = 0\), enclose the feasible region.
  3. Step 3: Find intersection (corner) points: Solve the lines pairwise. Intersection of \(x - 2y = 0\) and \(x + y = 60\): from \(x = 2y\), we get \(2y + y = 60\), so \(y = 20\) and \(x = 40\), giving \((40, 20)\). Intersection of \(x - 2y = 0\) and \(x + 2y = 120\): adding gives \(2x = 120\), so \(x = 60\) and \(y = 30\), giving \((60, 30)\). The line \(x + y = 60\) meets the x-axis at \((60, 0)\), and \(x + 2y = 120\) meets the x-axis at \((120, 0)\).
  4. Step 4: Identify the corner points of the feasible region: Checking which points satisfy all constraints, the feasible region is a bounded region with corner points \((60, 0)\), \((120, 0)\), \((60, 30)\), and \((40, 20)\).
  5. Step 5: Evaluate Z at each corner point: At \((60, 0)\): \(Z = 5(60) + 10(0) = 300\). At \((120, 0)\): \(Z = 5(120) + 10(0) = 600\). At \((60, 30)\): \(Z = 5(60) + 10(30) = 300 + 300 = 600\). At \((40, 20)\): \(Z = 5(40) + 10(20) = 200 + 200 = 400\).
  6. Step 6: Determine minimum and maximum: The smallest value of \(Z\) is \(300\), occurring at both \((60, 0)\) and... wait, only \((60, 0)\) gives \(300\). The largest value of \(Z\) is \(600\), occurring at BOTH \((120, 0)\) and \((60, 30)\). Let us re-read: the minimum \(Z = 300\) at \((60, 0)\); the maximum \(Z = 600\) occurs at two corner points \((120, 0)\) and \((60, 30)\).
  7. Step 7: Conclude that the maximum occurs at more than two points: Since \(Z = 600\) at both corner points \((120, 0)\) and \((60, 30)\), which lie on the same boundary line \(x + 2y = 120\), the objective function takes the value \(600\) at EVERY point on the segment joining \((120, 0)\) and \((60, 30)\). Hence the optimum (maximum) value \(600\) occurs at infinitely many points, that is, at more than two points.

Final Answer

Minimum value of \(Z\) is \(300\) at the point \((60, 0)\). Maximum value of \(Z\) is \(600\), and it occurs at both \((120, 0)\) and \((60, 30)\); therefore \(Z = 600\) at every point on the line segment joining these two vertices, i.e. at more than two points.

Common Mistake

A common mistake is to stop after finding that two corner points give equal optimal value and conclude the answer occurs 'at two points'. In fact, when two adjacent vertices give the same optimal value, EVERY point on the segment joining them is optimal, so the optimum occurs at infinitely many (more than two) points.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: State the problem: We need to minimise and maximise \(Z = 5x + 10y\) subject to the constraints \(x + 2y \le 120\), \(x + y \ge 60\), \(x - 2y \ge 0\), and \(x \ge 0\), \(y \ge 0\). — Reason: Clearly listing every constraint prevents us from accidentally missing a boundary when drawing the feasible region.
  2. Step 2: Find the boundary lines: Replace each inequality with an equation to get the boundary lines: \(x + 2y = 120\), \(x + y = 60\), and \(x - 2y = 0\) (i.e. \(x = 2y\)). Also include the non-negativity boundaries \(x = 0\) and \(y = 0\). — Reason: Plotting these lines allows us to identify the feasible region by shading the side that satisfies each inequality.
  3. Step 3: Identify the corner points of the feasible region: Solving pairs of boundary equations simultaneously gives the vertices. Intersection of \(x + y = 60\) and \(x - 2y = 0\): from \(x = 2y\), substituting gives \(2y + y = 60\), so \(y = 20\) and \(x = 40\), yielding the point \((40, 20)\). Intersection of \(x + y = 60\) and \(y = 0\): gives the point \((60, 0)\). Intersection of \(x + 2y = 120\) and \(x - 2y = 0\): from \(x = 2y\), substituting gives \(2y + 2y = 120\), so \(y = 30\) and \(x = 60\), yielding the point \((60, 30)\). Intersection of \(x + 2y = 120\) and \(y = 0\): gives the point \((120, 0)\). — Reason: The optimal value of \(Z\) can only occur at these corner points, so finding them accurately is crucial.
  4. Step 4: Verify all corner points lie in the feasible region: Check each vertex against every constraint. For \((60, 0)\): \(60 + 0 = 60 \le 120\) ✓, \(60 + 0 = 60 \ge 60\) ✓, \(60 - 0 = 60 \ge 0\) ✓. For \((120, 0)\): \(120 + 0 = 120 \le 120\) ✓, \(120 \ge 60\) ✓, \(120 \ge 0\) ✓. For \((60, 30)\): \(60 + 60 = 120 \le 120\) ✓, \(90 \ge 60\) ✓, \(60 - 60 = 0 \ge 0\) ✓. For \((40, 20)\): \(40 + 40 = 80 \le 120\) ✓, \(60 \ge 60\) ✓, \(40 - 40 = 0 \ge 0\) ✓. — Reason: Only feasible points are valid candidates for optimality; an infeasible vertex must be discarded.
  5. Step 5: Evaluate Z at each corner point: Substitute each vertex into \(Z = 5x + 10y\): \nAt \((60, 0)\): \[Z = 5(60) + 10(0) = 300 + 0 = 300\]\nAt \((120, 0)\): \[Z = 5(120) + 10(0) = 600 + 0 = 600\]\nAt \((60, 30)\): \[Z = 5(60) + 10(30) = 300 + 300 = 600\]\nAt \((40, 20)\): \[Z = 5(40) + 10(20) = 200 + 200 = 400\] — Reason: The Corner Point Theorem guarantees the optimal value occurs here, so a direct numerical comparison identifies both the minimum and maximum.
  6. Step 6: Identify minimum and maximum values: Comparing all four values — \(300, 600, 600, 400\) — the smallest is \(300\) at \((60, 0)\) and the largest is \(600\). Crucially, \(Z = 600\) at both \((120, 0)\) and \((60, 30)\). — Reason: When two corner points share the same optimal value, we must invoke the special case rule before declaring the final answer.
  7. Step 7: Apply the multiple-optimal rule: Because \(Z = 600\) at two adjacent vertices \((120, 0)\) and \((60, 30)\), every point on the line segment joining them also gives \(Z = 600\). A general point on this segment can be written as \((1 - t)(120, 0) + t(60, 30) = (120 - 60t,\ 30t)\) for \(t \in [0, 1]\), and substituting: \[Z = 5(120 - 60t) + 10(30t) = 600 - 300t + 300t = 600\] confirming \(Z = 600\) throughout the segment. — Reason: This rule shows the maximum is achieved at infinitely many points, not just two vertices, which is the key conclusion the problem asks us to demonstrate.

Final Answer

Minimum value of \(Z\) is \(300\) at the point \((60, 0)\). Maximum value of \(Z\) is \(600\), and it occurs at both \((120, 0)\) and \((60, 30)\); therefore \(Z = 600\) at every point on the line segment joining these two vertices, i.e. at more than two points.

Common Mistake

One common mistake: students stop as soon as they spot the largest \(Z\) value at one corner and declare that the unique maximum, missing the fact that another corner also gives the same value — always check ALL corner points before concluding, and if two adjacent corners tie, explicitly state that the maximum (or minimum) is achieved at every point on the segment between them.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Identify corner points of the feasible region: Solving boundary lines \(x + 2y = 120\), \(x + y = 60\), \(x - 2y = 0\) pairwise with \(x, y \ge 0\) gives vertices: \((60, 0)\), \((120, 0)\), \((60, 30)\).
  2. Step 2: Evaluate \(Z\) at each vertex: At \((60, 0)\): \(Z = 5(60) + 10(0) = 300\). At \((120, 0)\): \(Z = 5(120) + 10(0) = 600\). At \((60, 30)\): \(Z = 5(60) + 10(30) = 300 + 300 = 600\).
  3. Step 3: Identify minimum and maximum: Minimum \(Z = 300\) at \((60, 0)\). Maximum \(Z = 600\) at both \((120, 0)\) and \((60, 30)\), so \(Z = 600\) at every point on the segment joining them.

Answer: Minimum value of \(Z\) is \(300\) at the point \((60, 0)\). Maximum value of \(Z\) is \(600\), and it occurs at both \((120, 0)\) and \((60, 30)\); therefore \(Z = 600\) at every point on the line segment joining these two vertices, i.e. at more than two points.

➕ More Examples

More Examples

Example 1

Question: Minimise and Maximise \( Z = 3x + 6y \) subject to the constraints \( x + 2y \le 100 \), \( x + y \ge 50 \), \( x - 2y \ge 0 \), \( x \ge 0 \), \( y \ge 0 \). Show that the minimum of \( Z \) occurs at more than one point.

Solution: First, rewrite the constraints for clarity: \[ x + 2y \le 100 \] \[ x + y \ge 50 \] \[ x - 2y \ge 0 \] \[ x \ge 0, \quad y \ge 0 \] Find boundary line intersections to get the vertices of the feasible region. Intersection of \( x + 2y = 100 \) and \( x + y = 50 \): Subtracting the second from the first: \( y = 50 \). Then \( x = 0 \). Check \( x - 2y \ge 0 \): \( 0 - 100 = -100 < 0 \). This point does NOT satisfy all constraints, so it is not a vertex of the feasible region. Intersection of \( x + y = 50 \) and \( x - 2y = 0 \): From \( x = 2y \), substitute: \( 2y + y = 50 \), so \( y = \frac{50}{3} \) and \( x = \frac{100}{3} \). Point: \( A = \left(\frac{100}{3},\ \frac{50}{3}\right) \). Intersection of \( x + 2y = 100 \) and \( x - 2y = 0 \): Adding: \( 2x = 100 \), so \( x = 50 \) and \( y = 25 \). Point: \( B = (50,\ 25) \). Check \( x + y = 75 \ge 50 \). Valid. Intersection of \( x + y = 50 \) and \( y = 0 \): \( x = 50 \), giving point \( C = (50,\ 0) \). Check \( x - 2y = 50 \ge 0 \). Check \( x + 2y = 50 \le 100 \). Valid. Intersection of \( x + 2y = 100 \) and \( y = 0 \): \( x = 100 \), giving point \( D = (100,\ 0) \). Check \( x + y = 100 \ge 50 \). Check \( x - 2y = 100 \ge 0 \). Valid. So the feasible region has vertices \( A = \left(\frac{100}{3},\ \frac{50}{3}\right) \), \( B = (50,\ 25) \), \( D = (100,\ 0) \), \( C = (50,\ 0) \). Now evaluate \( Z = 3x + 6y \) at each vertex: At \( A = \left(\frac{100}{3}, \frac{50}{3}\right) \): \[ Z = 3 \cdot \frac{100}{3} + 6 \cdot \frac{50}{3} = 100 + 100 = 200 \] At \( B = (50,\ 25) \): \[ Z = 3(50) + 6(25) = 150 + 150 = 300 \] At \( C = (50,\ 0) \): \[ Z = 3(50) + 6(0) = 150 \] At \( D = (100,\ 0) \): \[ Z = 3(100) + 6(0) = 300 \] Summary of values: Minimum \( Z = 150 \) at \( C = (50, 0) \) only. Maximum \( Z = 300 \) at both \( B = (50, 25) \) and \( D = (100, 0) \). Since the maximum value of \( Z \) is 300 at two adjacent vertices \( B \) and \( D \), the maximum occurs at every point on the segment \( BD \). The segment \( BD \) lies on the line \( y = 0 \) from \( x = 50 \) to \( x = 100 \). Let us verify: on \( BD \) we can write any point as \( (x, 0) \) with \( 50 \le x \le 100 \). Then \( Z = 3x \). Wait — this is not constant. Let us recheck. Recheck edge \( B = (50, 25) \) to \( D = (100, 0) \): this edge lies on \( x + 2y = 100 \). On this edge \( x = 100 - 2y \), so \( Z = 3(100 - 2y) + 6y = 300 - 6y + 6y = 300 \). Constant! So the maximum \( Z = 300 \) is attained at every point on segment \( BD \), i.e., at infinitely many points. Minimum \( Z = 150 \) is attained only at the single point \( C = (50, 0) \).

Answer: Minimum value of \( Z = 150 \) at \( (50, 0) \). Maximum value of \( Z = 300 \), attained at every point on the segment joining \( B = (50, 25) \) and \( D = (100, 0) \) (i.e., at more than two points).

Example 2

Question: Minimise and Maximise \( Z = 4x + 8y \) subject to \( 2x + 4y \le 160 \), \( 2x + 2y \ge 80 \), \( 2x - 4y \ge 0 \), \( x \ge 0 \), \( y \ge 0 \). Determine whether the minimum value of \( Z \) occurs at more than one point.

Solution: Simplify the constraints by dividing where possible: Divide constraint 1 by 2: \( x + 2y \le 80 \) Divide constraint 2 by 2: \( x + y \ge 40 \) Divide constraint 3 by 2: \( x - 2y \ge 0 \) Also \( x \ge 0 \), \( y \ge 0 \). Divide \( Z \) by... we keep \( Z = 4x + 8y \) as given. Find vertices of the feasible region. Intersection of \( x + y = 40 \) and \( x - 2y = 0 \): From \( x = 2y \): \( 2y + y = 40 \), so \( y = \frac{40}{3} \), \( x = \frac{80}{3} \). Check \( x + 2y = \frac{80}{3} + \frac{80}{3} = \frac{160}{3} \approx 53.3 \le 80 \). Valid. Vertex \( A = \left(\frac{80}{3},\ \frac{40}{3}\right) \). Intersection of \( x + 2y = 80 \) and \( x - 2y = 0 \): Adding: \( 2x = 80 \), so \( x = 40 \), \( y = 20 \). Check \( x + y = 60 \ge 40 \). Valid. Vertex \( B = (40,\ 20) \). Intersection of \( x + 2y = 80 \) and \( y = 0 \): \( x = 80 \). Check \( x + y = 80 \ge 40 \). Check \( x - 2y = 80 \ge 0 \). Valid. Vertex \( D = (80,\ 0) \). Intersection of \( x + y = 40 \) and \( y = 0 \): \( x = 40 \). Check \( x - 2y = 40 \ge 0 \). Check \( x + 2y = 40 \le 80 \). Valid. Vertex \( C = (40,\ 0) \). So vertices are \( A = \left(\frac{80}{3}, \frac{40}{3}\right) \), \( B = (40, 20) \), \( D = (80, 0) \), \( C = (40, 0) \). Evaluate \( Z = 4x + 8y \) at each vertex: At \( A = \left(\frac{80}{3}, \frac{40}{3}\right) \): \[ Z = 4 \cdot \frac{80}{3} + 8 \cdot \frac{40}{3} = \frac{320}{3} + \frac{320}{3} = \frac{640}{3} \approx 213.3 \] At \( B = (40, 20) \): \[ Z = 4(40) + 8(20) = 160 + 160 = 320 \] At \( C = (40, 0) \): \[ Z = 4(40) + 8(0) = 160 \] At \( D = (80, 0) \): \[ Z = 4(80) + 8(0) = 320 \] So minimum \( Z = 160 \) at \( C = (40, 0) \) only, and maximum \( Z = 320 \) at both \( B = (40, 20) \) and \( D = (80, 0) \). Check that the maximum is attained along edge \( BD \): edge \( BD \) lies on \( x + 2y = 80 \), so \( x = 80 - 2y \). Substituting: \[ Z = 4(80 - 2y) + 8y = 320 - 8y + 8y = 320 \] This is constant along \( BD \), confirming the maximum \( Z = 320 \) is achieved at every point on the line segment from \( B = (40, 20) \) to \( D = (80, 0) \). Now check whether the minimum occurs at more than one point. Edge \( CA \) lies on \( x - 2y = 0 \) (i.e., \( x = 2y \)). On this edge: \[ Z = 4(2y) + 8y = 8y + 8y = 16y \] This is not constant (it varies with \( y \)), so the minimum is only at \( C = (40, 0) \). Edge \( CC' \) (along \( y = 0 \) from \( C \) to \( D \)): \( Z = 4x \), which increases from 160 to 320. So the minimum occurs at the single point \( C \). Conclusion: The minimum value of \( Z \) is 160, attained only at \( C = (40, 0) \). The maximum value of \( Z \) is 320, attained at every point on segment \( BD \), i.e., at more than two points.

Answer: Minimum value of \( Z = 160 \) at the single point \( (40, 0) \). Maximum value of \( Z = 320 \), attained at every point on the segment joining \( B = (40, 20) \) and \( D = (80, 0) \) — i.e., at infinitely many points.

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: Write Down the Constraints: The constraints are: \nConstraint 1: \( x + 2y \le 100 \) \nConstraint 2: \( x + y \ge 50 \) \nConstraint 3: \( x - 2y \ge 0 \), i.e., \( x \ge 2y \) \nNon-negativity: \( x \ge 0,\ y \ge 0 \)
  2. Step 2: Find the Boundary Lines and Key Intersection Points: Consider the boundary lines as equalities. \nLine L1: \( x + 2y = 100 \) \nLine L2: \( x + y = 50 \) \nLine L3: \( x - 2y = 0 \), i.e., \( x = 2y \) \nIntersection of L2 and L3 (i.e., \( x + y = 50 \) and \( x = 2y \)): \nSubstituting \( x = 2y \) into \( x + y = 50 \): \[ 2y + y = 50 \Rightarrow 3y = 50 \Rightarrow y = \frac{50}{3} \] This gives a non-integer point. Let us re-examine intersections with the axes and among all three lines. \nIntersection of L1 and L3 (i.e., \( x + 2y = 100 \) and \( x = 2y \)): \nSubstituting \( x = 2y \) into \( x + 2y = 100 \): \[ 2y + 2y = 100 \Rightarrow 4y = 100 \Rightarrow y = 25,\ x = 50 \] So the point is \( (50, 25) \). \nIntersection of L1 and L2 (i.e., \( x + 2y = 100 \) and \( x + y = 50 \)): \nSubtracting L2 from L1: \[ (x + 2y) - (x + y) = 100 - 50 \Rightarrow y = 50,\ x = 0 \] But check L3: \( x \ge 2y \Rightarrow 0 \ge 100 \) which is false. So \( (0, 50) \) is not feasible. \nIntersection of L2 with x-axis (set \( y = 0 \) in \( x + y = 50 \)): \( x = 50 \), giving point \( (50, 0) \). \nIntersection of L1 with x-axis (set \( y = 0 \) in \( x + 2y = 100 \)): \( x = 100 \), giving point \( (100, 0) \).
  3. Step 3: Identify the Feasible Region Vertices: We must satisfy all constraints simultaneously: \( x + 2y \le 100 \), \( x + y \ge 50 \), \( x \ge 2y \), \( x \ge 0 \), \( y \ge 0 \). \nCheck \( (50, 0) \): \( 50 + 0 = 50 \le 100 \) ✓, \( 50 + 0 = 50 \ge 50 \) ✓, \( 50 \ge 0 \) ✓. Feasible. \nCheck \( (100, 0) \): \( 100 + 0 = 100 \le 100 \) ✓, \( 100 + 0 = 100 \ge 50 \) ✓, \( 100 \ge 0 \) ✓. Feasible. \nCheck \( (50, 25) \): \( 50 + 50 = 100 \le 100 \) ✓, \( 50 + 25 = 75 \ge 50 \) ✓, \( 50 \ge 50 \) ✓. Feasible. \nThus the corner points of the feasible region are \( (50, 0) \), \( (100, 0) \), and \( (50, 25) \).
  4. Step 4: Evaluate the Objective Function at Each Corner Point: The objective function is \( Z = 3x + 6y \). \nAt \( (50, 0) \): \[ Z = 3(50) + 6(0) = 150 \] \nAt \( (100, 0) \): \[ Z = 3(100) + 6(0) = 300 \] \nAt \( (50, 25) \): \[ Z = 3(50) + 6(25) = 150 + 150 = 300 \]
  5. Step 5: Determine Minimum and Maximum: From the computed values: \nMinimum value of \( Z \) is \( 150 \), occurring at the vertex \( (50, 0) \). \nMaximum value of \( Z \) is \( 300 \), occurring at both \( (100, 0) \) and \( (50, 25) \). \nSince the maximum value \( 300 \) is attained at two adjacent vertices \( (100, 0) \) and \( (50, 25) \), the objective function \( Z = 3x + 6y \) equals \( 300 \) at every point on the line segment joining these two vertices. \nThis is because the line segment joining \( (100, 0) \) and \( (50, 25) \) lies along the boundary line \( x + 2y = 100 \), and on this segment \( Z = 3x + 6(y) = 3x + 6y \). Since \( x = 100 - 2y \), we get \[ Z = 3(100 - 2y) + 6y = 300 - 6y + 6y = 300 \] which is constant. Hence the maximum occurs at infinitely many (more than two) points.

Answer: Minimum value of \( Z \) is \( 150 \) at the point \( (50, 0) \). Maximum value of \( Z \) is \( 300 \), and it occurs at both \( (100, 0) \) and \( (50, 25) \); therefore \( Z = 300 \) at every point on the line segment joining these two vertices, i.e., at more than two points.

Everything you get with Solver7

More questions in Linear Programming