According to the linear programming principle, we predict, that towards the intersections of the constraint points in the viability area, and its optimal solution exists. The sketch shows the points that are (0,16), (3,1), and (6,0).

by putting each point value into the objective function:

$\to P(0,16) = 768\\\\\to P(3,1) = 183\\\\\to P(6,0) = 270$

Thus, the objective of the function is reduced with a value of 183 at (3,1).

5 0

3 years ago

Write an equation of the line passing through the point (3, 4) that is parallel to the line −2x+3y=2

mote1985 [20]

Parallel lines have same slope, so first isolate y to get the equation into y=mx+b form.

-2x+3y=2

3y = 2x + 2

$y = \frac{2x+2}{3}$

Now plug the point (3,4) into y = 2x + b

4 = 2(3) + b

Solves for be

b = -2

So the new equation is y = 2x - 2

5 0

3 years ago

Read 2 more answers

PLEASE HELP IT IS TIMED!! I WILL GIVE YOU THE BRAINLIEST

never [62]

Answer:

x= 12.3

y=8.4

Step-by-step explanation:

4 0

3 years ago