enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Optimal stopping - Wikipedia

    en.wikipedia.org/wiki/Optimal_stopping

    A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation , and are therefore often solved using dynamic programming .

  3. Littlewood's rule - Wikipedia

    en.wikipedia.org/wiki/Littlewood's_rule

    If the capacity left is less than this limit demand for class 2 is rejected. If a continuous distribution F j ( x ) {\displaystyle F_{j}(x)} is used to model the demand, then y 1 ⋆ {\displaystyle y_{1}^{\star }} can be calculated using what is called Littlewood’s rule :

  4. Newsvendor model - Wikipedia

    en.wikipedia.org/wiki/Newsvendor_model

    The mathematical problem appears to date from 1888 [2] where Edgeworth used the central limit theorem to determine the optimal cash reserves to satisfy random withdrawals from depositors. [3] According to Chen, Cheng, Choi and Wang (2016), the term "newsboy" was first mentioned in an example of the Morse and Kimball (1951)'s book. [4]

  5. Law of demand - Wikipedia

    en.wikipedia.org/wiki/Law_of_demand

    Examples of Veblen goods are mostly luxurious items such as diamond, gold, precious stones, world-famous paintings, antiques etc. [6] Veblen goods appear to go against the law of demand because of their exclusivity appeal, in the sense that if a price of a luxurious and expensive product is increased, it may attract the status-conscious group ...

  6. Cobweb model - Wikipedia

    en.wikipedia.org/wiki/Cobweb_model

    The cobweb model is generally based on a time lag between supply and demand decisions. Agricultural markets are a context where the cobweb model might apply, since there is a lag between planting and harvesting (Kaldor, 1934, p. 133–134 gives two agricultural examples: rubber and corn). Suppose for example that as a result of unexpectedly bad ...

  7. Queueing theory - Wikipedia

    en.wikipedia.org/wiki/Queueing_theory

    In discrete-time networks where there is a constraint on which service nodes can be active at any time, the max-weight scheduling algorithm chooses a service policy to give optimal throughput in the case that each job visits only a single-person service node. [21]

  8. Sonnenschein–Mantel–Debreu theorem - Wikipedia

    en.wikipedia.org/wiki/Sonnenschein–Mantel...

    Theorem — Let be a positive integer. If : {: =,, >} is a set-valued function with closed graph that satisfies Walras's law, then there exists an economy with households indexed by , with no producers ("pure exchange economy"), and household endowments {} such that each household satisfies all assumptions in the "Assumptions" section except the "strict convexity" assumption, and is the excess ...

  9. Ramsey problem - Wikipedia

    en.wikipedia.org/wiki/Ramsey_problem

    The Ramsey problem, or Ramsey pricing, or Ramsey–Boiteux pricing, is a second-best policy problem concerning what prices a public monopoly should charge for the various products it sells in order to maximize social welfare (the sum of producer and consumer surplus) while earning enough revenue to cover its fixed costs.