Example 1
Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = 5x + 4y \) subject to the constraints \( x + y \le 8 \), \( 2x + y \le 12 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: Step 1: Convert each constraint inequality to an equation and find intercepts. For \( x + y = 8 \): when \( x = 0 \), \( y = 8 \); when \( y = 0 \), \( x = 8 \). Points: \( (0, 8) \) and \( (8, 0) \). For \( 2x + y = 12 \): when \( x = 0 \), \( y = 12 \); when \( y = 0 \), \( x = 6 \). Points: \( (0, 12) \) and \( (6, 0) \). Step 2: Plot both lines and shade the feasible region satisfying all constraints (including \( x \ge 0 \), \( y \ge 0 \)). Step 3: Find the corner points of the feasible region. Corner O: \( (0, 0) \) Corner A: \( (6, 0) \) (intersection of \( 2x + y = 12 \) with the x-axis) Corner B: intersection of \( x + y = 8 \) and \( 2x + y = 12 \). Subtracting: \( (2x + y) - (x + y) = 12 - 8 \), giving \( x = 4 \). Then \( y = 8 - 4 = 4 \). So Corner B is \( (4, 4) \). Corner C: \( (0, 8) \) (intersection of \( x + y = 8 \) with the y-axis) Step 4: Evaluate \( Z = 5x + 4y \) at each corner point. At \( O(0, 0) \): \[ Z = 5(0) + 4(0) = 0 \] At \( A(6, 0) \): \[ Z = 5(6) + 4(0) = 30 \] At \( B(4, 4) \): \[ Z = 5(4) + 4(4) = 20 + 16 = 36 \] At \( C(0, 8) \): \[ Z = 5(0) + 4(8) = 32 \] Step 5: The maximum value of \( Z \) is \( 36 \), achieved at the corner point \( (4, 4) \).
Answer: Maximum value of \( Z = 36 \) at \( x = 4 \), \( y = 4 \).
Example 2
Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = 4x + 6y \) subject to the constraints \( 3x + 2y \le 18 \), \( x + 2y \le 10 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: Step 1: Convert each constraint inequality to an equation and find intercepts. For \( 3x + 2y = 18 \): when \( x = 0 \), \( y = 9 \); when \( y = 0 \), \( x = 6 \). Points: \( (0, 9) \) and \( (6, 0) \). For \( x + 2y = 10 \): when \( x = 0 \), \( y = 5 \); when \( y = 0 \), \( x = 10 \). Points: \( (0, 5) \) and \( (10, 0) \). Step 2: Plot both lines and shade the feasible region satisfying all constraints. Step 3: Find the corner points of the feasible region. Corner O: \( (0, 0) \) Corner A: \( (6, 0) \) (intersection of \( 3x + 2y = 18 \) with the x-axis) Corner B: intersection of \( 3x + 2y = 18 \) and \( x + 2y = 10 \). Subtracting: \( (3x + 2y) - (x + 2y) = 18 - 10 \), giving \( 2x = 8 \), so \( x = 4 \). Substituting into \( x + 2y = 10 \): \( 4 + 2y = 10 \), so \( y = 3 \). Corner B is \( (4, 3) \). Corner C: \( (0, 5) \) (intersection of \( x + 2y = 10 \) with the y-axis) Step 4: Evaluate \( Z = 4x + 6y \) at each corner point. At \( O(0, 0) \): \[ Z = 4(0) + 6(0) = 0 \] At \( A(6, 0) \): \[ Z = 4(6) + 6(0) = 24 \] At \( B(4, 3) \): \[ Z = 4(4) + 6(3) = 16 + 18 = 34 \] At \( C(0, 5) \): \[ Z = 4(0) + 6(5) = 30 \] Step 5: The maximum value of \( Z \) is \( 34 \), achieved at the corner point \( (4, 3) \).
Answer: Maximum value of \( Z = 34 \) at \( x = 4 \), \( y = 3 \).