Example 1
Question: The corner points of the feasible region of an LPP are \( (0, 3) \), \( (5, 0) \), \( (5, 7) \), and \( (0, 6) \). The objective function is \( Z = 3x + 5y \). Find (Maximum of Z) - (Minimum of Z).
Solution: We evaluate \( Z = 3x + 5y \) at each corner point of the feasible region. At \( (0, 3) \): \[ Z = 3(0) + 5(3) = 0 + 15 = 15 \] At \( (5, 0) \): \[ Z = 3(5) + 5(0) = 15 + 0 = 15 \] At \( (5, 7) \): \[ Z = 3(5) + 5(7) = 15 + 35 = 50 \] At \( (0, 6) \): \[ Z = 3(0) + 5(6) = 0 + 30 = 30 \] Comparing all values: \( 15, 15, 50, 30 \). Maximum of Z = 50 (at the corner point \( (5, 7) \)). Minimum of Z = 15 (at the corner points \( (0, 3) \) and \( (5, 0) \)). Therefore, (Maximum of Z) - (Minimum of Z): \[ 50 - 15 = 35 \]
Answer: 35
Example 2
Question: The corner points of the feasible region of an LPP are \( (1, 0) \), \( (4, 0) \), \( (4, 5) \), \( (2, 6) \), and \( (0, 4) \). The objective function is \( Z = 5x + 4y \). Find (Maximum of Z) - (Minimum of Z).
Solution: We evaluate \( Z = 5x + 4y \) at each corner point of the feasible region. At \( (1, 0) \): \[ Z = 5(1) + 4(0) = 5 + 0 = 5 \] At \( (4, 0) \): \[ Z = 5(4) + 4(0) = 20 + 0 = 20 \] At \( (4, 5) \): \[ Z = 5(4) + 4(5) = 20 + 20 = 40 \] At \( (2, 6) \): \[ Z = 5(2) + 4(6) = 10 + 24 = 34 \] At \( (0, 4) \): \[ Z = 5(0) + 4(4) = 0 + 16 = 16 \] Comparing all values: \( 5, 20, 40, 34, 16 \). Maximum of Z = 40 (at the corner point \( (4, 5) \)). Minimum of Z = 5 (at the corner point \( (1, 0) \)). Therefore, (Maximum of Z) - (Minimum of Z): \[ 40 - 5 = 35 \]
Answer: 35