The objective function is Maximize z=2x+3y.
In linear programming, the maximum value occurs at one of the corner points of the feasible region.
The corner points are (0,0), (1,2), and (1,1).
Evaluating z=2x+3y at each corner point:
At point (0,0):
z=2(0)+3(0)
z=0
At point (1,2):
z=2(1)+3(2)
z=2+6
z=8
At point (1,1):
z=2(1)+3(1)
z=2+3
z=5
Comparing the values:
- At (0,0): z=0
- At (1,2): z=8
- At (1,1): z=5
The maximum value is 8, occurring at corner point (1,2).
Therefore, the optimal value is 8.