The feasible region of a linear programming problem has vertices (-1,-2), (0,7), (2,5), (5,3), (8,-1) find the minimum and maximum values of the objective function C(x, y)=15x+9y

the direct variation says that:

then the equation is of the form is given by:

            where k is the constant variation.

from the given table:

consider any value of x and m(x)=y

x = 2 and m(x)=y = 3

substitute these value in [1]; we have;

divide both sides by 2 we get;

⇒

check:

put x = -1 and m(x) = -1.5

substitute in the equation:

-1.5 = -1.5                   true

therefore, the function m(x) represents a direct variation

graph of this function as shown below:

umumumumum

im not sure

a

step-by-step explanation:

aloha~! my name is zalgo and i am here to you out on this amazing day. to answer your question, yes, nonzero numbers can have a greatest common factor and that would be 1. still don't get it? let me considering every number is divisible by 1 and hence every number has 1 as a factor of theirs. so, if 2 nonzero numbers didn't share any gcf (greatest common factor), they would still have a factor in common and that would be 1.

i hope that this ! : p

"stay and stay proud! " - zalgo

(by the way, do you mind marking me as brainliest? i'd greatly appreciate it! mahalo! x3)