Example 1
Question: Solve the following Linear Programming Problem graphically: Maximize \( Z = \dfrac{x}{4} + \dfrac{y}{3} \) subject to the constraints \( 3x + 2y \le 1200 \), \( x + 2y \le 800 \), \( x \ge 0 \), \( y \ge 0 \).
Solution: We need to maximize \( Z = \dfrac{x}{4} + \dfrac{y}{3} \) subject to \( 3x + 2y \le 1200 \), \( x + 2y \le 800 \), \( x \ge 0 \), \( y \ge 0 \). Finding boundary lines and intercepts: For \( 3x + 2y = 1200 \): x-intercept at \( (400, 0) \), y-intercept at \( (0, 600) \). For \( x + 2y = 800 \): x-intercept at \( (800, 0) \), y-intercept at \( (0, 400) \). Finding the intersection of \( 3x + 2y = 1200 \) and \( x + 2y = 800 \): Subtracting the second equation from the first: \( 2x = 400 \), so \( x = 200 \). Substituting into \( x + 2y = 800 \): \( 200 + 2y = 800 \), giving \( y = 300 \). Intersection point: \( (200, 300) \). The feasible region is bounded by the origin and satisfies all constraints. The corner points are: \( A = (0, 0) \), \( B = (400, 0) \), \( C = (200, 300) \), \( D = (0, 400) \). Note: \( (800, 0) \) does NOT satisfy \( 3x + 2y \le 1200 \) since \( 3(800) = 2400 > 1200 \), so it is outside the feasible region. Evaluating \( Z = \dfrac{x}{4} + \dfrac{y}{3} \) at each corner point: At \( A = (0, 0) \): \[ Z = \frac{0}{4} + \frac{0}{3} = 0 \] At \( B = (400, 0) \): \[ Z = \frac{400}{4} + \frac{0}{3} = 100 \] At \( C = (200, 300) \): \[ Z = \frac{200}{4} + \frac{300}{3} = 50 + 100 = 150 \] At \( D = (0, 400) \): \[ Z = \frac{0}{4} + \frac{400}{3} = \frac{400}{3} \approx 133.33 \] The maximum value of Z is \( 150 \) at the point \( (200, 300) \).
Answer: Maximum \( Z = 150 \) at \( x = 200 \), \( y = 300 \).
Example 2
Question: A factory produces two products P and Q. The profit per unit of P is \( \rupee \, 5 \) and per unit of Q is \( \rupee \, 8 \). The production is subject to the constraints: \( 4x + 2y \le 600 \) and \( 2x + 4y \le 480 \), where \( x \) and \( y \) are the numbers of units of P and Q produced respectively. Also \( x \ge 0 \), \( y \ge 0 \). Formulate and solve graphically the Linear Programming Problem to maximize the total profit \( Z = 5x + 8y \).
Solution: We need to maximize \( Z = 5x + 8y \) subject to \( 4x + 2y \le 600 \), \( 2x + 4y \le 480 \), \( x \ge 0 \), \( y \ge 0 \). Finding boundary lines and intercepts: For \( 4x + 2y = 600 \): x-intercept at \( (150, 0) \), y-intercept at \( (0, 300) \). For \( 2x + 4y = 480 \): x-intercept at \( (240, 0) \), y-intercept at \( (0, 120) \). Finding the intersection of \( 4x + 2y = 600 \) and \( 2x + 4y = 480 \): Multiplying the second equation by 2: \( 4x + 8y = 960 \). Subtracting the first equation: \( 6y = 360 \), so \( y = 60 \). Substituting into \( 2x + 4(60) = 480 \): \( 2x = 240 \), so \( x = 120 \). Intersection point: \( (120, 60) \). Checking corner points of the feasible region: \( (0, 0) \): satisfies both constraints. \( (150, 0) \): check \( 2(150) + 4(0) = 300 \le 480 \) — valid. \( (0, 120) \): check \( 4(0) + 2(120) = 240 \le 600 \) — valid. Note: \( (0, 300) \) does NOT satisfy \( 2x + 4y \le 480 \) since \( 4(300) = 1200 > 480 \). The corner points of the feasible region are: \( O = (0, 0) \), \( A = (150, 0) \), \( B = (120, 60) \), \( C = (0, 120) \). Evaluating \( Z = 5x + 8y \) at each corner point: At \( O = (0, 0) \): \[ Z = 5(0) + 8(0) = 0 \] At \( A = (150, 0) \): \[ Z = 5(150) + 8(0) = 750 \] At \( B = (120, 60) \): \[ Z = 5(120) + 8(60) = 600 + 480 = 1080 \] At \( C = (0, 120) \): \[ Z = 5(0) + 8(120) = 960 \] The maximum value of Z is \( 1080 \) at the point \( (120, 60) \).
Answer: Maximum profit \( Z = \rupee \, 1080 \) at \( x = 120 \) units of P and \( y = 60 \) units of Q.