What point in the feasible region maximizes the objective function constraints: x> =0 y> =0 -x+3> =y y< =1/3 x+1 objective function: c=5x-4y

x = 3, y = 0

Step-by-step explanation:

In a linear programming problem, optimum point is on a vertex of the feasible region. In figure feasible region is shown in orange. So, the possible optimal points are (0,0), (0,1), (1.5, 1.5) and (3, 0). Evaluating them in objective function gives

Point      | Objective function

(0,0)      | 0

(0,1)      | -4

(1.5, 1.5) | 1.5  

(3, 0)     | 15

Then, the maximum is x = 3, y = 0

“exterior angles of triangles. an exterior (or external) angle is the angle between one side of a triangle and the extension of an adjacent side. try this drag the orange dots on any vertex to reshape the triangle.” look to get to the answer i explained what it means and other things i hope it you .

Ithink it’s b because it say 3 plastic rings and all the balls