Example 1
Question: Solve the following linear programming problem graphically: Maximise \( Z = 5x + 3y \) subject to the constraints: \[ x + y \le 60 \] \[ 2x + y \le 90 \] \[ x \ge 0,\quad y \ge 0 \]
Solution: We need to maximise \( Z = 5x + 3y \) subject to the given constraints. First, find the boundary lines and their intercepts. For constraint \( x + y = 60 \): when \( x = 0 \), \( y = 60 \); when \( y = 0 \), \( x = 60 \). For constraint \( 2x + y = 90 \): when \( x = 0 \), \( y = 90 \); when \( y = 0 \), \( x = 45 \). The feasible region is bounded by these lines and the non-negativity constraints \( x \ge 0 \) and \( y \ge 0 \). Next, find the corner points of the feasible region. Corner point A is at the origin: \( (0, 0) \). Corner point B is where \( 2x + y = 90 \) meets the x-axis: \( (45, 0) \). Corner point C is the intersection of \( x + y = 60 \) and \( 2x + y = 90 \). Subtracting the first from the second: \[ (2x + y) - (x + y) = 90 - 60 \] \[ x = 30 \] Substituting back: \( 30 + y = 60 \), so \( y = 30 \). Corner point C is \( (30, 30) \). Corner point D is where \( x + y = 60 \) meets the y-axis: \( (0, 60) \). Now evaluate \( Z = 5x + 3y \) at each corner point. At \( A(0, 0) \): \[ Z = 5(0) + 3(0) = 0 \] At \( B(45, 0) \): \[ Z = 5(45) + 3(0) = 225 \] At \( C(30, 30) \): \[ Z = 5(30) + 3(30) = 150 + 90 = 240 \] At \( D(0, 60) \): \[ Z = 5(0) + 3(60) = 180 \] The maximum value of \( Z \) is 240, achieved at \( (30, 30) \).
Answer: Maximum value of \( Z = 240 \) at \( x = 30,\ y = 30 \).
Example 2
Question: Solve the following linear programming problem graphically: Maximise \( Z = 3x + 5y \) subject to the constraints: \[ x + 2y \le 80 \] \[ 3x + 2y \le 120 \] \[ x \ge 0,\quad y \ge 0 \]
Solution: We need to maximise \( Z = 3x + 5y \) subject to the given constraints. First, find the boundary lines and their intercepts. For constraint \( x + 2y = 80 \): when \( x = 0 \), \( y = 40 \); when \( y = 0 \), \( x = 80 \). For constraint \( 3x + 2y = 120 \): when \( x = 0 \), \( y = 60 \); when \( y = 0 \), \( x = 40 \). The feasible region satisfies both constraints along with \( x \ge 0 \) and \( y \ge 0 \). Identify the corner points of the feasible region. Corner point A is at the origin: \( (0, 0) \). Corner point B is where \( 3x + 2y = 120 \) meets the x-axis: \( (40, 0) \). Corner point C is the intersection of \( x + 2y = 80 \) and \( 3x + 2y = 120 \). Subtracting the first equation from the second: \[ (3x + 2y) - (x + 2y) = 120 - 80 \] \[ 2x = 40 \] \[ x = 20 \] Substituting back: \( 20 + 2y = 80 \), so \( 2y = 60 \), giving \( y = 30 \). Corner point C is \( (20, 30) \). Corner point D is where \( x + 2y = 80 \) meets the y-axis: \( (0, 40) \). Note: The point \( (0, 60) \) from the second constraint lies outside the feasible region because it violates \( x + 2y \le 80 \) (check: \( 0 + 120 = 120 > 80 \)). Now evaluate \( Z = 3x + 5y \) at each corner point. At \( A(0, 0) \): \[ Z = 3(0) + 5(0) = 0 \] At \( B(40, 0) \): \[ Z = 3(40) + 5(0) = 120 \] At \( C(20, 30) \): \[ Z = 3(20) + 5(30) = 60 + 150 = 210 \] At \( D(0, 40) \): \[ Z = 3(0) + 5(40) = 200 \] The maximum value of \( Z \) is 210, achieved at \( (20, 30) \).
Answer: Maximum value of \( Z = 210 \) at \( x = 20,\ y = 30 \).