C
explaination Hsjsksksodhveomgomgzksnnsnsnsnns
Answer:
Solution : (15, - 11)
Step-by-step explanation:
We want to solve this problem using a matrix, so it would be wise to apply Gaussian elimination. Doing so we can start by writing out the matrix of the coefficients, and the solutions ( - 5 and - 2 ) --- ( 1 )

Now let's begin by canceling the leading coefficient in each row, reaching row echelon form, as we desire --- ( 2 )
Row Echelon Form :

Step # 1 : Swap the first and second matrix rows,

Step # 2 : Cancel leading coefficient in row 2 through
,

Now we can continue canceling the leading coefficient in each row, and finally reach the following matrix.

As you can see our solution is x = 15, y = - 11 or (15, - 11).
Answer:
"absolute value function," y = |x|
Step-by-step explanation:
This is the graph of the "absolute value function," y = |x|.
Answer:
12 dolars
Step-by-step explanation:
Answer:
A. -12
Step-by-step explanation:
A graph shows the vertices of the feasible region to be (0, 6), (3, 0) and (0, -3). Of these, the one that minimizes f(x, y) is (0, -3). The minimum value is ...
f(0, -3) = 3·0 + 4(-3) = -12
_____
<em>Comment on the graph</em>
Here, three regions overlap to form the region where solutions are feasible. By reversing the inequality in each of the constraints, <em>the feasible region shows up on the graph as a white space</em>, making it easier to identify. The corner of the feasible region that minimizes the objective function is the one at the bottom, at (0, -3).