Note: enter your answer and show all the steps that you use to solve this problem in the space provided.

what point in the feasible region maximizes the objective function?

constraints:
x ≥ 0
y ≥ 0
−x + 3 ≥ y
y ≤ 1/3x + 1
objective function:
c = 5x – 4y

The point that maximizes the objective function is (3,0)

Step-by-step explanation:

we have

Constraints:

Using a graphing tool

The feasible region is the shaded area

see the attached figure

The vertices of the feasible region are

(0,0),(0,1),(1.5,1.5) and (3,0)

we know that

To find the point in the feasible region that maximizes the objective function, replace each ordered pair of vertices in the objective function and then compare the results.

The objective function is

For (0,0) ----->

For (0,1) ----->

For (1.5,1.5) ----->

For (3,0) ----->

therefore

The point that maximizes the objective function is (3,0)

its d. the first coordintaes are 10,32

step-by-step explanation: