Example 1
Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = 5x + 3y \) subject to the constraints \( 2x + y \le 6 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: We need to maximise \( Z = 5x + 3y \) subject to \( 2x + y \le 6 \), \( x \ge 0 \), \( y \ge 0 \). Step 1: Find the boundary line of the constraint \( 2x + y = 6 \). When \( x = 0 \): \( y = 6 \), giving point \( (0, 6) \). When \( y = 0 \): \( x = 3 \), giving point \( (3, 0) \). Step 2: The feasible region is bounded by \( 2x + y \le 6 \), \( x \ge 0 \), \( y \ge 0 \). It is a triangle with vertices at \( (0, 0) \), \( (3, 0) \), and \( (0, 6) \). Step 3: Evaluate \( Z = 5x + 3y \) at each corner point. At \( (0, 0) \): \[ Z = 5(0) + 3(0) = 0 \] At \( (3, 0) \): \[ Z = 5(3) + 3(0) = 15 \] At \( (0, 6) \): \[ Z = 5(0) + 3(6) = 18 \] Step 4: The maximum value of \( Z \) is \( 18 \), attained at \( (0, 6) \).
Answer: Maximum \( Z = 18 \) at \( (0, 6) \).
Example 2
Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = 2x + 5y \) subject to the constraints \( x + 2y \le 8 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: We need to maximise \( Z = 2x + 5y \) subject to \( x + 2y \le 8 \), \( x \ge 0 \), \( y \ge 0 \). Step 1: Find the boundary line of the constraint \( x + 2y = 8 \). When \( x = 0 \): \( 2y = 8 \), so \( y = 4 \), giving point \( (0, 4) \). When \( y = 0 \): \( x = 8 \), giving point \( (8, 0) \). Step 2: The feasible region is bounded by \( x + 2y \le 8 \), \( x \ge 0 \), \( y \ge 0 \). It is a triangle with vertices at \( (0, 0) \), \( (8, 0) \), and \( (0, 4) \). Step 3: Evaluate \( Z = 2x + 5y \) at each corner point. At \( (0, 0) \): \[ Z = 2(0) + 5(0) = 0 \] At \( (8, 0) \): \[ Z = 2(8) + 5(0) = 16 \] At \( (0, 4) \): \[ Z = 2(0) + 5(4) = 20 \] Step 4: The maximum value of \( Z \) is \( 20 \), attained at \( (0, 4) \).
Answer: Maximum \( Z = 20 \) at \( (0, 4) \).