/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q11SE Suppose that you are going to se... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Suppose that you are going to sell cola at a football game and must decide in advance how much to order. Suppose that the demand for cola at the game, in liters, has a continuous distribution with p.d.f. f (x). Suppose that you make a profit ofgcents on each liter that you sell at the game and suffer a loss ofccents on each liter that you order but do not sell. What is the optimal amount of cola for you to order so as to maximize your expected net gain?

Short Answer

Expert verified

The optimal amount of cola for us to order is \(\frac{g}{{g + c}}\) . so as to maximize our expected net gain.

Step by step solution

01

Given information

We are going to sell cola at a football game. The demand for the cola at the game is denoted by X and follows a continuous distribution with a probability density function\(f\left( x \right)\).

The profit is g cents for each liter. The loss is c cents when we order cola but cannot sell it.

02

State the events

Suppose we order P liters of cola and the demand is x. Now when\(\left( {P \le x} \right)\), that is, the quantity of the order is less or equal to the demand, we make the profit of g cents.

If \(\left( {P > x} \right)\),that is the quantity of the order is greater than demand then we make the net gain of \(\left( {gx - c\left( {P - x} \right)} \right)\) cents.

03

Calculate the expected gain

Now the expected gain, G is given by,

\(\begin{aligned}{c}E\left( G \right) &= \int\limits_P^\infty {\left( {gP} \right)f\left( x \right)dx + \int\limits_0^P {\left( {gx - c\left( {P - x} \right)} \right)f\left( x \right)dx} } \\ &= gP\left( {1 - \int\limits_0^P {f\left( x \right)dx} } \right) + \int\limits_0^P {\left( {gx - cP + cx} \right)f\left( x \right)dx} \\ &= gP\left( {1 - F\left( P \right)} \right) + \left( {g + c} \right)\int\limits_0^P {xf\left( x \right)dx - cP\int\limits_0^P {f\left( x \right)dx} } \\ &= gP\left( {1 - F\left( P \right)} \right) + \left( {g + c} \right)\int\limits_0^P {xf\left( x \right)dx - cPF\left( P \right)} \end{aligned}\)

Now,

\(\begin{aligned}{c}\left( {g + c} \right)\int\limits_0^P {xf\left( x \right)dx = \left( {g + c} \right)\left( {\left\{ {x\int\limits_0^P {f\left( x \right)dx} } \right\} - \int\limits_0^P {\left\{ {\frac{\partial }{{\partial x}}x\int\limits_0^P {f\left( x \right)dx} } \right\}} } \right)} \\ = \left( {g + c} \right)\left( {\left\{ {xF\left( x \right)} \right\}_0^P - \int\limits_0^P {\left\{ {F\left( P \right)} \right\}dx} } \right)\\ = \left( {g + c} \right)\left( {\left\{ {PF\left( P \right)} \right\} - PF\left( P \right)} \right)\\ = 0\end{aligned}\)

Thus, the expected gain is,

\(E\left( G \right) = gP\left( {1 - F\left( P \right)} \right) - cPF\left( P \right) \cdots \left( 1 \right)\)

04

Maximize the expected gain

To maximize the expected gain we have to find the value of P. We have to differentiate E(G) with respect to P. So,

\(\begin{aligned}{c}\frac{{\partial E\left( G \right)}}{{\partial P}} &= \frac{\partial }{{\partial P}}\left( {gP\left\{ {1 - F\left( P \right)} \right\} - cPF\left( P \right)} \right)\\ &= \frac{\partial }{{\partial P}}\left( {gP - gPF\left( P \right) - cPF\left( P \right)} \right)\\ &= \frac{\partial }{{\partial P}}\left( {gP - \left( {g + c} \right)PF\left( P \right)} \right)\end{aligned}\)

By using the product rule, we get,

\(\frac{{\partial E\left( G \right)}}{{\partial P}} = g - \left( {g + c} \right)F\left( P \right)\)

Now, by equating the differential with respect to 0, we get,

\(\begin{aligned}{c}\frac{{\partial E\left( G \right)}}{{\partial P}} = 0\\ \Rightarrow g - \left( {g + c} \right)F\left( P \right) = 0\\ \Rightarrow F\left( P \right) = \frac{g}{{\left( {g + c} \right)}} \cdots \left( 2 \right)\end{aligned}\)

Thus, we should order that amount of cola which amount satisfies the equation (1).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Consider a state lottery game in which each winning combination and each ticket consists of one set of k numbers chosen from the numbers 1 to n without replacement. We shall compute the probability that the winning combination contains at least one pair of consecutive numbers.

a. Prove that if\({\bf{n < 2k - 1}}\), then every winning combination has at least one pair of consecutive numbers. For the rest of the problem, assume that\({\bf{n}} \le {\bf{2k - 1}}\).

b. Let\({{\bf{i}}_{\bf{1}}}{\bf{ < }}...{\bf{ < }}{{\bf{i}}_{\bf{k}}}\)be an arbitrary possible winning combination arranged in order from smallest to largest. For\({\bf{s = 1,}}...{\bf{,k}}\), let\({{\bf{j}}_{\bf{s}}}{\bf{ = }}{{\bf{i}}_{\bf{s}}}{\bf{ - }}\left( {{\bf{s - 1}}} \right)\). That is,

\(\begin{array}{c}{{\bf{j}}_{\bf{1}}}{\bf{ = }}{{\bf{i}}_{\bf{1}}}\\{{\bf{j}}_{\bf{2}}}{\bf{ = }}{{\bf{i}}_{\bf{2}}}{\bf{ - 1}}\\{\bf{.}}\\{\bf{.}}\\{\bf{.}}\\{{\bf{j}}_{\bf{k}}}{\bf{ = }}{{\bf{i}}_{\bf{k}}}{\bf{ - }}\left( {{\bf{k - 1}}} \right)\end{array}\)

Prove that\(\left( {{{\bf{i}}_{\bf{1}}}{\bf{,}}...{\bf{,}}{{\bf{i}}_{\bf{k}}}} \right)\)contains at least one pair of consecutive numbers if and only if\(\left( {{{\bf{j}}_{\bf{1}}}{\bf{,}}...{\bf{,}}{{\bf{j}}_{\bf{k}}}} \right)\)contains repeated numbers.

c. Prove that\({\bf{1}} \le {{\bf{j}}_{\bf{1}}} \le ... \le {{\bf{j}}_{\bf{k}}} \le {\bf{n - k + 1}}\)and that the number of\(\left( {{{\bf{j}}_{\bf{1}}}{\bf{,}}...{\bf{,}}{{\bf{j}}_{\bf{k}}}} \right)\)sets with no repeats is\(\left( {\begin{array}{*{20}{c}}{{\bf{n - k + 1}}}\\{\bf{k}}\end{array}} \right)\)

d. Find the probability that there is no pair of consecutive numbers in the winning combination.

e. Find the probability of at least one pair of consecutive numbers in the winning combination

Consider, once again, the four blood types A, B, AB, and O described in Exercise 8 in Sec. 1.4 together with the two antigens anti-A and anti-B. Suppose that, for a given person, the probability of type O blood is 0.5, the probability of type A blood is 0.34, and the probability of

type B blood is 0.12.

a. Find the probability that each of the antigens will

react with this person’s blood.

b. Find the probability that both antigens will react with

this person’s blood

Three pollsters will canvas a neighborhood with 21 houses. Each pollster will visit seven of the houses. How many different assignments of pollsters to houses are possible?

Most of the calculation in Example 3.8.4 is quite general.Suppose that X has a continuous distribution withp.d.f. \({\bf{f}}\) . Let\({\bf{Y = }}{{\bf{X}}^{\bf{2}}}\), and show that the p.d.f. of Y is

\({\bf{g}}\left( {\bf{y}} \right){\bf{ = }}\frac{{\bf{1}}}{{{\bf{2}}{{\bf{y}}^{\frac{{\bf{1}}}{{\bf{2}}}}}}}\left[ {{\bf{f}}\left( {{{\bf{y}}^{\frac{{\bf{1}}}{{\bf{2}}}}}} \right){\bf{ + f}}\left( {{\bf{ - }}{{\bf{y}}^{\frac{{\bf{1}}}{{\bf{2}}}}}} \right)} \right]\)

Suppose that two committees are to be formed in an organization with 300 members. If one committee has five members and the other committee has eight members, how many different ways can these committees be selected?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.