Start by graphing the two constraints.
(Which I can not do here.)
GRAPHING TIPS:
> For each constraint, graph two points.
Graph the x and y intercepts.
For the first constraint, you get: (0,9), (6,0)
For the 2nd constraint, you get: (0,3), (4,0)
> Drawing a dotted line between the two sets of intercepts
and shade in the feasible region.
> Note that x > 0 and y > 0
Those are constraints too. But these constraints
just tell you to stay in the first quadrant
where both x and y are positive.
> With all four constraints, you will have a
4-sided region. The four corners are the
critical points.
FIND THE EXTREMA
> To find the extrema, evaluate the function
at each critical point.
f(x,y) = 2x + 3y
f(0.9) = 2(0) + 3(9) = 27. MAX
f(6,0) = 2(6) + 3(0) = 12
f(0,3) = 2(0) + 3(3) = 9
f(4,0) = 2(4) + 3(0) = 8
Note: The feasible region
does NOT include the lines and corners
because the equations for the constraints are
inequalities without the equal part.
I have a feeling that the original problem statement
showed constraints with inequalities WITH the equal part.
If the problem statement is correct and the constraints
are correct, then the MAX would be < 27.