Example 1
Question: Solve the following Linear Programming Problem graphically: Minimise \( Z = 3x + y \) subject to the constraints \( x + y \ge 4 \), \( 3x + 2y \ge 9 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: Step 1: Identify the constraints and objective function. Objective function: Minimise \( Z = 3x + y \) Constraints: \( x + y \ge 4 \), \( 3x + 2y \ge 9 \), \( x \ge 0 \), \( y \ge 0 \). Step 2: Find boundary lines and key intercepts. For \( x + y = 4 \): intercepts are \( (4, 0) \) and \( (0, 4) \). For \( 3x + 2y = 9 \): intercepts are \( (3, 0) \) and \( (0, 4.5) \). Step 3: Find the intersection of the two boundary lines. From \( x + y = 4 \) we get \( y = 4 - x \). Substituting into \( 3x + 2y = 9 \): \[ 3x + 2(4 - x) = 9 \] \[ 3x + 8 - 2x = 9 \] \[ x = 1, \quad y = 3 \] So the lines meet at \( (1, 3) \). Step 4: Identify the corner points of the feasible region. Since both constraints are of the \( \ge \) type and \( x, y \ge 0 \), the feasible region is unbounded (above and to the right of both lines). The relevant vertices are: From \( 3x + 2y \ge 9 \) along the x-axis: \( (3, 0) \). Check \( x + y \ge 4 \): \( 3 + 0 = 3 < 4 \). Not feasible. From \( x + y \ge 4 \) along the x-axis: \( (4, 0) \). Check \( 3x + 2y \ge 9 \): \( 12 \ge 9 \). Feasible. From \( 3x + 2y \ge 9 \) along the y-axis: \( (0, 4.5) \). Check \( x + y \ge 4 \): \( 4.5 \ge 4 \). Feasible. Intersection point: \( (1, 3) \). Check both constraints: \( 1 + 3 = 4 \ge 4 \) and \( 3(1) + 2(3) = 9 \ge 9 \). Feasible. Corner points of the feasible region: \( (4, 0) \), \( (1, 3) \), and \( (0, 4.5) \). Step 5: Evaluate \( Z = 3x + y \) at each corner point. At \( (4, 0) \): \( Z = 3(4) + 0 = 12 \) At \( (1, 3) \): \( Z = 3(1) + 3 = 6 \) At \( (0, 4.5) \): \( Z = 3(0) + 4.5 = 4.5 \) Step 6: Check for unbounded minimum. Draw the half-plane \( 3x + y < 4.5 \) and check if it intersects the feasible region. The line \( 3x + y = 4.5 \) passes below \( (0, 4.5) \) and does not share any common point with the feasible region (the feasible region lies entirely on or above both constraint lines). Therefore the minimum is indeed attained. The minimum value of \( Z \) is \( 4.5 \) at \( (0, 4.5) \).
Answer: Minimum \( Z = 4.5 \) at \( (0, 4.5) \).
Example 2
Question: Solve the following Linear Programming Problem graphically: Minimise \( Z = 2x + 5y \) subject to the constraints \( x + 2y \ge 4 \), \( 3x + y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: Step 1: Identify the constraints and objective function. Objective function: Minimise \( Z = 2x + 5y \) Constraints: \( x + 2y \ge 4 \), \( 3x + y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \). Step 2: Find boundary lines and key intercepts. For \( x + 2y = 4 \): intercepts are \( (4, 0) \) and \( (0, 2) \). For \( 3x + y = 6 \): intercepts are \( (2, 0) \) and \( (0, 6) \). Step 3: Find the intersection of the two boundary lines. From \( 3x + y = 6 \) we get \( y = 6 - 3x \). Substituting into \( x + 2y = 4 \): \[ x + 2(6 - 3x) = 4 \] \[ x + 12 - 6x = 4 \] \[ -5x = -8 \] \[ x = \frac{8}{5}, \quad y = 6 - 3 \cdot \frac{8}{5} = 6 - \frac{24}{5} = \frac{6}{5} \] The lines meet at \( \left(\dfrac{8}{5},\, \dfrac{6}{5}\right) \). Step 4: Identify the corner points of the feasible region. Check \( (4, 0) \): \( 3(4) + 0 = 12 \ge 6 \). Feasible. Check \( (0, 6) \): \( 0 + 2(6) = 12 \ge 4 \). Feasible. Check \( (2, 0) \): \( 2 + 0 = 2 < 4 \). Not feasible. Check \( (0, 2) \): \( 3(0) + 2 = 2 < 6 \). Not feasible. Corner points of the feasible region: \( (4, 0) \), \( \left(\dfrac{8}{5}, \dfrac{6}{5}\right) \), and \( (0, 6) \). Step 5: Evaluate \( Z = 2x + 5y \) at each corner point. At \( (4, 0) \): \( Z = 2(4) + 5(0) = 8 \) At \( \left(\dfrac{8}{5}, \dfrac{6}{5}\right) \): \( Z = 2 \cdot \dfrac{8}{5} + 5 \cdot \dfrac{6}{5} = \dfrac{16}{5} + \dfrac{30}{5} = \dfrac{46}{5} = 9.2 \) At \( (0, 6) \): \( Z = 2(0) + 5(6) = 30 \) Step 6: Check for unbounded minimum. The open half-plane \( 2x + 5y < 8 \) does not intersect the feasible region (every point in the feasible region satisfies \( Z \ge 8 \)), so the minimum is attained. The minimum value of \( Z \) is \( 8 \) at \( (4, 0) \).
Answer: Minimum \( Z = 8 \) at \( (4, 0) \).