IDEAS home Printed from https://ideas.repec.org/h/spr/sptchp/978-3-662-60608-7_7.html
   My bibliography  Save this book chapter

Chance-Constrained Models

In: Enterprise Risk Management Models

Author

Listed:
  • David L. Olson

    (University of Nebraska)

  • Desheng Wu

    (University of Chinese Academy of Sciences
    Stockholm University)

Abstract

Chance-constrained programming was developed as a means of describing constraints in mathematical programming models in the form of probability levels of attainment. Consideration of chance constraints allows decision makers to consider mathematical programming objectives in terms of the probability of their attainment. If α is a predetermined confidence level desired by a decision maker, the implication is that a constraint will be violated at most (1 – α) of all possible cases. A number of different types of models can be built using chance constraints. The first form is to maximize the linear expected return subject to attaining specified probabilities of reaching specified targets. The second is to minimize variance. This second form is not that useful, in that the lowest variance is actually to not invest. Here we forced investment of the 1000 capital assumed. The third form is to maximize probability of attaining some target, which in order to be useful, has to be infeasible. Chance-constrained models have been used in many applications. Here we have focused on financial planning, but there have been applications whenever statistical data is available in an optimization problem.

Suggested Citation

  • David L. Olson & Desheng Wu, 2020. "Chance-Constrained Models," Springer Texts in Business and Economics, in: Enterprise Risk Management Models, edition 3, chapter 7, pages 93-108, Springer.
    • Handle: RePEc:spr:sptchp:978-3-662-60608-7_7
    DOI: 10.1007/978-3-662-60608-7_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sptchp:978-3-662-60608-7_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.