Explain why the linear programming problem has an optimal solution, and find it using the table method.
Maximize P = 15x + 30X2
subject to - 4x4 + x2 s 20
X, S 50
Xy, xz 20
Explain why the linear programming problem has an optimal solution.
1f (X4 X2) is a point in the feasible region, then 0 sxy s 50 and 0 sxs 220. Thus, the feasible region is bounded.
(Simplify your answers.)
Find the optimal solution. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice.
O A The function is maximized when x2 = 50 and x2 = 220), where P = 7,350
(Simplify your answers.)
B. The system has no optimal solution.

i'm pretty sure it's c. nvm

the probability is 0

step-by-step explanation:

first you will have to convert 3/4 into a decimal

which is .75

then you will have to divide 1.5 by .75

which is 2

no you have to divide

c. 27 units.

step-by-step explanation:

we are told that in circle a, ∠bae ≅ ∠dae.

we can see from our given diagram that in and ;

, as these are radii of our given circle.

therefore, by sas congruence postulate.

hence, side be will be equal to side de as corresponding parts of congruent triangles are congruent. so we can set an equation to find the value of x as:

now let us substitute x=17 in the expression for the length of be.

therefore, length of be will be 27 units and option c is the correct choice.