When a feasible region is bounded on all sides, where will the maximum and minimum values of the objective function occur? at the center of the feasible region
at the top of the feasible region
anywhere within the feasible region
at the vertices of the feasible region

Option 4: at the vertices of the feasible region.

I completed the quiz

the answer   is 200

step-by-step explanation:

this is a problem about poisson probabilities.   i don't know if you've

already studied poisson distributions, or if you have a place to look

to read more about the subject.  

here's how you can see a poisson distribution coming.   when there are

a lot of events that may happen at any time (or any place), and when

you're counting how many of them happen at a particular time (or a

particular place), and each event is independent of the others, then

the result is a poisson distribution.   this is roughly true for the

chocolate chips; one chip being in a cookie has only a small effect on

the probability that another chip will be in the cookie.

once you know you have a poisson distribution, you know a lot.   there

is only one parameter to a poisson distribution, so if you know the

mean, you know everything.   the form of the distribution is

  probability of n chips = {[e^(-x)]*(x^n)} / (n! )

according to the triangle sum theorem, all the angles in a triangle must add up to 180 degrees. if we know one angle is already 90, we do 180-90=90. the other 2 angles must add up to 90, exactly.

step-by-step explanation: