Maximize z = 6000x+1800y
subject to constraints
We find the intercepts and draw the lines 6x+3y=330 and 50x+10y=2300
By the inequality symbols, we see the feasible region is on and
above the x-axis, on or to the right of the y-axis, and on or below
the other two lines. So we shade the feasible region:
So we evaluate the objective function z = 6000x+1800y
at each corner point of the feasible region.
At (0,0), 6000(0)+1800(0) = 0 kSh
At (46,0), 6000(46)+1800(0) = 276,000 kSh
At (40,30), 6000(40)+1800(30) = 494,000 kSh
At (0,110), 6000(0)+1800(110) = 198,000 kSh
So the maximum profit is 494,000 kSh when there are 40 type A
cabins and 30 type B cabins.
Edwin