Solve graphically: maximise Z = 2x + y subject to x + y \leq 1200, x + y \geq 600, y \leq x/2, x \geq 0, y \geq 0
Linear Programming: Graphical Method for Optimization
KEY FORMULA / RULE: According to the Corner Point Theorem of linear programming, the optimal value (maximum or minimum) of a linear objective function Z = ax + by over a bounded, convex feasible polygon always occurs at one of its extreme points (vertices).
SOLUTION STEPS
Step 1 — Identify the Boundary Lines and Feasible Region
Convert the given inequalities into linear equations to find their graphical boundaries in the first quadrant (x \ge 0, y \ge 0):
- L_1: x + y = 1200 passes through (1200, 0) and (0, 1200). The inequality x + y \le 1200 includes the region toward the origin.
- L_2: x + y = 600 passes through (600, 0) and (0, 600). The inequality x + y \ge 600 includes the region away from the origin.
- L_3: y = \frac{x}{2} \iff x - 2y = 0 passes through the origin (0, 0) and (400, 200). The inequality y \le \frac{x}{2} lies on and below this line.
The intersection of these half-planes defines a closed, bounded four-sided feasible region.
Step 2 — Determine the Vertices (Corner Points)
Find the coordinates of the vertices where the boundary lines intersect:
- Intersection of x + y = 600 and y = 0:A = (600, 0)
- Intersection of x + y = 1200 and y = 0:B = (1200, 0)
- Intersection of x + y = 1200 and y = \frac{x}{2}:x + \frac{x}{2} = 1200 \implies \frac{3x}{2} = 1200 \implies C = (800, 400)
- Intersection of x + y = 600 and y = \frac{x}{2}:x + \frac{x}{2} = 600 \implies \frac{3x}{2} = 600 \implies D = (400, 200)
Step 3 — Evaluate the Objective Function Z = 2x + y
Substitute each vertex into the objective function:
- At A(600, 0): Z = 2(600) + 0 = 1200
- At B(1200, 0): Z = 2(1200) + 0 = 2400
- At C(800, 400): Z = 2(800) + 400 = 2000
- At D(400, 200): Z = 2(400) + 200 = 1000
Comparing the values, the maximum occurs at vertex B.
FINAL ANSWER: Maximum Z = 2400 at (x, y) = (1200, 0)
EXAM INSIGHT / PITFALL: Students often mistakenly assume the maximum occurs at the intersection of two non-axis constraints like (800, 400). Because the coefficient of x is twice the coefficient of y (Z = 2x + y), pushing x to its absolute maximum bound on the horizontal axis yields the optimal value.