You will have to graph the constraints and find the ordered pairs that make the feasible region.
Then you can plug-in those ordered pairs into the objective function.
Since you are trying to find the maximum, pick the ordered pair that has the greatest answer when put into the objective function.
What point in the feasible region maximizes the objective function ? (3 points)
Constraints {x>0
{y>0
{-x+3>y
{y<1/3x+1
Objective function : C=5x-4y
2 answers
1.5- (3/2,3/2)
1 answer