Example 1
Question: Solve the following linear programming problem graphically: Maximise \( Z = 5x + 4y \) Subject to constraints: \[ x + y \le 600 \] \[ 3x + y \le 900 \] \[ x \le 250 \] \[ x, y \ge 0 \]
Solution: We need to maximise \( Z = 5x + 4y \) subject to the given constraints. First, we find the boundary lines and their intercepts. For \( x + y = 600 \): intercepts are \( (600, 0) \) and \( (0, 600) \). For \( 3x + y = 900 \): intercepts are \( (300, 0) \) and \( (0, 900) \). For \( x = 250 \): a vertical line. The feasible region is bounded by all these constraints along with \( x \ge 0 \) and \( y \ge 0 \). Now we identify the corner points of the feasible region. Corner point A: Intersection of \( x = 0 \) and \( y = 0 \), giving \( A = (0, 0) \). Corner point B: Intersection of \( y = 0 \) and \( 3x + y = 900 \). Setting \( y = 0 \): \( 3x = 900 \), so \( x = 300 \). But \( x \le 250 \), so this point is outside the feasible region. Instead, use \( x = 250 \) and \( y = 0 \), giving \( B = (250, 0) \). Corner point C: Intersection of \( x = 250 \) and \( 3x + y = 900 \). Substituting \( x = 250 \): \( 750 + y = 900 \), so \( y = 150 \). Giving \( C = (250, 150) \). Check \( x + y \le 600 \): \( 250 + 150 = 400 \le 600 \). Valid. Corner point D: Intersection of \( 3x + y = 900 \) and \( x + y = 600 \). Subtracting: \( 2x = 300 \), so \( x = 150 \). Then \( y = 600 - 150 = 450 \). Giving \( D = (150, 450) \). Check \( x \le 250 \): \( 150 \le 250 \). Valid. Corner point E: Intersection of \( x = 0 \) and \( x + y = 600 \), giving \( y = 600 \), so \( E = (0, 600) \). Now evaluate \( Z = 5x + 4y \) at each corner point. At \( A = (0, 0) \): \[ Z = 5(0) + 4(0) = 0 \] At \( B = (250, 0) \): \[ Z = 5(250) + 4(0) = 1250 \] At \( C = (250, 150) \): \[ Z = 5(250) + 4(150) = 1250 + 600 = 1850 \] At \( D = (150, 450) \): \[ Z = 5(150) + 4(450) = 750 + 1800 = 2550 \] At \( E = (0, 600) \): \[ Z = 5(0) + 4(600) = 2400 \] The maximum value of \( Z \) is \( 2550 \) at \( D = (150, 450) \).
Answer: Maximum value of \( Z = 2550 \) at \( x = 150,\ y = 450 \).
Example 2
Question: A manufacturer produces two products P and Q. Each unit of P requires 2 hours on machine I and 1 hour on machine II. Each unit of Q requires 1 hour on machine I and 2 hours on machine II. Machine I is available for at most 700 hours and Machine II for at most 800 hours. The production of P is at most 300 units. If the profit per unit of P is \( \text{Rs. } 60 \) and per unit of Q is \( \text{Rs. } 50 \), formulate and solve the LPP graphically to maximise profit. Maximise \( Z = 60x + 50y \) Subject to constraints: \[ 2x + y \le 700 \] \[ x + 2y \le 800 \] \[ x \le 300 \] \[ x, y \ge 0 \]
Solution: We need to maximise \( Z = 60x + 50y \) subject to the given constraints. Find boundary lines and intercepts. For \( 2x + y = 700 \): intercepts are \( (350, 0) \) and \( (0, 700) \). For \( x + 2y = 800 \): intercepts are \( (800, 0) \) and \( (0, 400) \). For \( x = 300 \): a vertical line. We identify the corner points of the feasible region. Corner point A: \( (0, 0) \). Corner point B: Intersection of \( y = 0 \) and \( 2x + y = 700 \), giving \( x = 350 \). But \( x \le 300 \), so use \( x = 300,\ y = 0 \): \( B = (300, 0) \). Check \( 2(300) + 0 = 600 \le 700 \). Valid. Check \( 300 + 0 = 300 \le 800 \). Valid. Corner point C: Intersection of \( x = 300 \) and \( 2x + y = 700 \). Substituting: \( 600 + y = 700 \), so \( y = 100 \). Giving \( C = (300, 100) \). Check \( x + 2y = 300 + 200 = 500 \le 800 \). Valid. Corner point D: Intersection of \( 2x + y = 700 \) and \( x + 2y = 800 \). From the first equation: \( y = 700 - 2x \). Substituting into the second: \[ x + 2(700 - 2x) = 800 \] \[ x + 1400 - 4x = 800 \] \[ -3x = -600 \] \[ x = 200 \] Then \( y = 700 - 400 = 300 \). Giving \( D = (200, 300) \). Check \( x \le 300 \): \( 200 \le 300 \). Valid. Corner point E: Intersection of \( x = 0 \) and \( x + 2y = 800 \), giving \( y = 400 \), so \( E = (0, 400) \). Now evaluate \( Z = 60x + 50y \) at each corner point. At \( A = (0, 0) \): \[ Z = 60(0) + 50(0) = 0 \] At \( B = (300, 0) \): \[ Z = 60(300) + 50(0) = 18000 \] At \( C = (300, 100) \): \[ Z = 60(300) + 50(100) = 18000 + 5000 = 23000 \] At \( D = (200, 300) \): \[ Z = 60(200) + 50(300) = 12000 + 15000 = 27000 \] At \( E = (0, 400) \): \[ Z = 60(0) + 50(400) = 20000 \] The maximum value of \( Z \) is \( 27000 \) at \( D = (200, 300) \).
Answer: Maximum profit \( Z = \text{Rs. } 27000 \) at \( x = 200,\ y = 300 \) (200 units of P and 300 units of Q).