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.