IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-22884-1_3.html
   My bibliography  Save this book chapter

Robust Decisions under Risk for Imprecise Probabilities

In: Managing Safety of Heterogeneous Systems

Author

Listed:
  • Włodzimierz Ogryczak

    (Warsaw University of Technology)

Abstract

In this paper we analyze robust approaches to decision making under uncertainty where the expected outcome is maximized but the probabilities are known imprecisely. A conservative robust approach takes into account any probability distribution thus leading to the notion of robustness focusing on the worst case scenario and resulting in the max-min optimization. We consider softer robust models allowing the probabilities to vary only within given intervals. We show that the robust solution for only upper bounded probabilities becomes the tail mean, known also as the conditional value-at-risk (CVaR), with an appropriate tolerance level. For proportional upper and lower probability limits the corresponding robust solution may be expressed by the optimization of appropriately combined the mean and the tail mean criteria. Finally, a general robust solution for any arbitrary intervals of probabilities can be expressed with the optimization problem very similar to the tail mean and thereby easily implementable with auxiliary linear inequalities.

Suggested Citation

  • Włodzimierz Ogryczak, 2012. "Robust Decisions under Risk for Imprecise Probabilities," Lecture Notes in Economics and Mathematical Systems, in: Yuri Ermoliev & Marek Makowski & Kurt Marti (ed.), Managing Safety of Heterogeneous Systems, edition 127, pages 51-66, Springer.
  • Handle: RePEc:spr:lnechp:978-3-642-22884-1_3
    DOI: 10.1007/978-3-642-22884-1_3
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.

    More about this item

    Statistics

    Access and download statistics

    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:lnechp:978-3-642-22884-1_3. 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.