Example 1
Question: Solve the following Linear Programming Problem graphically: Maximise \ \( Z = 4x + 5y \) subject to the constraints \( 2x + y \le 8 \), \( x + 2y \le 10 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: We need to maximise \( Z = 4x + 5y \) subject to the given constraints. Constraint 1: \( 2x + y \le 8 \) The boundary line is \( 2x + y = 8 \). Setting \( x = 0 \) gives \( y = 8 \), and setting \( y = 0 \) gives \( x = 4 \). So the line passes through \( (0, 8) \) and \( (4, 0) \). Constraint 2: \( x + 2y \le 10 \) The boundary line is \( x + 2y = 10 \). Setting \( x = 0 \) gives \( y = 5 \), and setting \( y = 0 \) gives \( x = 10 \). So the line passes through \( (0, 5) \) and \( (10, 0) \). The feasible region is bounded by these lines and the axes in the first quadrant. Corner Points of the feasible region: Point A: Intersection of the y-axis and \( x + 2y = 10 \) gives \( (0, 5) \). Point B: Intersection of \( 2x + y = 8 \) and \( x + 2y = 10 \). From the first equation: \( y = 8 - 2x \). Substituting into the second: \[ x + 2(8 - 2x) = 10 \] \[ x + 16 - 4x = 10 \] \[ -3x = -6 \] \[ x = 2 \] Then \( y = 8 - 2(2) = 4 \). So Point B is \( (2, 4) \). Point C: Intersection of \( 2x + y = 8 \) and the x-axis gives \( (4, 0) \). Point O: Origin \( (0, 0) \). Now evaluate \( Z = 4x + 5y \) at each corner point: At \( O(0, 0) \): \[ Z = 4(0) + 5(0) = 0 \] At \( A(0, 5) \): \[ Z = 4(0) + 5(5) = 25 \] At \( B(2, 4) \): \[ Z = 4(2) + 5(4) = 8 + 20 = 28 \] At \( C(4, 0) \): \[ Z = 4(4) + 5(0) = 16 \] The maximum value of Z is 28, occurring at the point \( (2, 4) \).
Answer: Maximum value of \( Z = 28 \) at \( x = 2, y = 4 \).
Example 2
Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = 6x + 4y \) subject to the constraints \( x + y \le 6 \), \( 2x + y \le 10 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: We need to maximise \( Z = 6x + 4y \) subject to the given constraints. Constraint 1: \( x + y \le 6 \) The boundary line is \( x + y = 6 \). It passes through \( (0, 6) \) and \( (6, 0) \). Constraint 2: \( 2x + y \le 10 \) The boundary line is \( 2x + y = 10 \). It passes through \( (0, 10) \) and \( (5, 0) \). The feasible region is the area in the first quadrant satisfying both constraints. Corner Points of the feasible region: Point O: Origin \( (0, 0) \). Point A: Intersection of the y-axis and \( x + y = 6 \) gives \( (0, 6) \). Point B: Intersection of \( x + y = 6 \) and \( 2x + y = 10 \). Subtracting the first equation from the second: \[ (2x + y) - (x + y) = 10 - 6 \] \[ x = 4 \] Substituting back: \( 4 + y = 6 \), so \( y = 2 \). Point B is \( (4, 2) \). Point C: Intersection of \( 2x + y = 10 \) and the x-axis gives \( (5, 0) \). Now evaluate \( Z = 6x + 4y \) at each corner point: At \( O(0, 0) \): \[ Z = 6(0) + 4(0) = 0 \] At \( A(0, 6) \): \[ Z = 6(0) + 4(6) = 24 \] At \( B(4, 2) \): \[ Z = 6(4) + 4(2) = 24 + 8 = 32 \] At \( C(5, 0) \): \[ Z = 6(5) + 4(0) = 30 \] The maximum value of Z is 32, occurring at the point \( (4, 2) \).
Answer: Maximum value of \( Z = 32 \) at \( x = 4, y = 2 \).