Given the system of constraints, name all the vertices of the feasible region. then find the maximum value of the given objective function.
x> =0
y> =0
y=< 1/3x+3
5> =y+x

objective function: c=6x-4y

For (0, 0): C = 6(0) - 4(0) = 0

For (0, 3): C = 6(0) - 4(3) = -12

For (1.5, 3.5): C = 6(1.5) - 4(3.5) = 9 - 14 = -5

For (5, 0): C = 6(5) - 4(0) = 30

Step-by-step explanation:

(1, –1), (16, –4), (36, –6)

step-by-step explanation:

given that the function is

this can also be written as

we have to graph this function and check which list of points lie on the graph

see attachment for graph:

we find that the points lying are (1,-1) (16,-4) and (36,-6)

since square root is there we find that x can only be posiitve but y can be since square root both positive and negative.