The objective is to maximize z=x+y subject to:
x+4y≤8
2x+3y≤12
3x+y≤9
x≥0,y≥0
In linear programming, the maximum of z always occurs at a corner point of the feasible region.
Corner point A: Origin
A=(0,0)
Corner point B: x-axis intercept (y=0)
From constraint 1: x≤8
From constraint 2: x≤6
From constraint 3: x≤3 ← most restrictive
B=(3,0)
Corner point C: y-axis intercept (x=0)
From constraint 1: y≤2 ← most restrictive
From constraint 2: y≤4
From constraint 3: y≤9
C=(0,2)
Corner point D: Intersection of x+4y=8 and 3x+y=9
x+4y=8⋯(i)
3x+y=9⋯(ii)
From (ii): y=9−3x
x+4(9−3x)=8
x+36−12x=8
−11x=−28
x=1128
y=9−3(1128)
=1199−84
=1115
Checking constraint 2: 2(1128)+3(1115)=1156+45=11101≈9.18≤12 ✅
D=(1128,1115)
The other intersections are not feasible:
Intersection of constraints 2 and 3 gives (715,718), but constraint 1: 715+4×718=787≈12.4>8 ✗
Intersection of constraints 1 and 2 gives (524,54), but constraint 3: 3×524+54=576=15.2>9 ✗
Evaluating z=x+y at each corner point:
A(0,0):z=0+0=0
B(3,0):z=3+0=3
C(0,2):z=0+2=2
D(1128,1115):z=1128+1115=1143
zmax=1143=31110
zmax=31110