Example 1
Question: The corner points of the feasible region of an LPP are \( (0, 0) \), \( (0, 50) \), \( (30, 50) \), \( (70, 10) \), and \( (70, 0) \). If the objective function is \( Z = 5x + 2y \), find the maximum value of \( Z \). (A) 360 (B) 370 (C) 100 (D) 150
Solution: We evaluate the objective function \( Z = 5x + 2y \) at each corner point of the feasible region. At \( (0, 0) \): \[ Z = 5(0) + 2(0) = 0 \] At \( (0, 50) \): \[ Z = 5(0) + 2(50) = 100 \] At \( (30, 50) \): \[ Z = 5(30) + 2(50) = 150 + 100 = 250 \] At \( (70, 10) \): \[ Z = 5(70) + 2(10) = 350 + 20 = 370 \] At \( (70, 0) \): \[ Z = 5(70) + 2(0) = 350 \] Comparing all values: \( 0, 100, 250, 370, 350 \). The maximum value of \( Z \) is \( 370 \), occurring at the corner point \( (70, 10) \).
Answer: (B) 370
Example 2
Question: The corner points of the feasible region determined by a system of linear constraints are \( (0, 0) \), \( (0, 30) \), \( (10, 30) \), \( (40, 15) \), and \( (40, 0) \). The objective function of an LPP is \( Z = 6x + 4y \). What is the maximum value of \( Z \)? (A) 180 (B) 120 (C) 300 (D) 300
Solution: We evaluate the objective function \( Z = 6x + 4y \) at each corner point of the feasible region. At \( (0, 0) \): \[ Z = 6(0) + 4(0) = 0 \] At \( (0, 30) \): \[ Z = 6(0) + 4(30) = 120 \] At \( (10, 30) \): \[ Z = 6(10) + 4(30) = 60 + 120 = 180 \] At \( (40, 15) \): \[ Z = 6(40) + 4(15) = 240 + 60 = 300 \] At \( (40, 0) \): \[ Z = 6(40) + 4(0) = 240 \] Comparing all values: \( 0, 120, 180, 300, 240 \). The maximum value of \( Z \) is \( 300 \), occurring at the corner point \( (40, 15) \).
Answer: (C) or (D) 300