Consider a linear programming problem with the following constraints and objective function, P The constraints are graphed below.

What is the maximum value of the objective function for the feasible region?
The maximum value of the objective function for the feasible region is type your answer.

what i would say the best answer is a. 40.5

step-by-step explanation:

left be aligning the decimal points is required to not required see the number of digits to the right

answer: integers are just whole numbers: positive, negative, and zero.

i = {-∞, -2, -1, 0, 1, 2, 3, ∞}

let x = 1st integer

let y = 2nd integer

x = 3y + 17   {equation 1}

xy = -24         {equation 2}

substitute 3y+17 in place of x n equation 2

and solve for y.

(3y+17)y = -24

3y2 + 17y = -24

3y2 + 17y + 24 = 0

from quadratic equation:

y = [-17±√(172-4(3)(24))]/(2(3))

y = (-17 ±√1)/6

y = (-17+1)/6   or     y = (-17-1)/6

y = -16/6           or     y = -18/6

y = -2 2/3         or   y = -3

since we are dealing with

y = -3

x = 3y+17 = -9+17 = 8

the integers are -3, 8

step-by-step explanation:

you estimate that the angle of elevation to the top of the 86th floor (the observatory) is 82 .the total height of the building is another 123 meters above the 86th floor.

leave feedback if u need : )