IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-981-99-5491-9_16.html
   My bibliography  Save this book chapter

Modeling and Solving Robust Chance-Constrained Binary Programs Using Sample Average Approximations

In: Optimization Essentials

Author

Listed:
  • Shanshan Wang

    (Beijing Institute of Technology)

  • Mohsen Mohammadi

    (Northwestern University)

  • Sanjay Mehrotra

    (Northwestern University)

Abstract

This chapter describes the modeling and solution approaches for binary programs involving chance constraints with ambiguously described probability distributions followed by the parameters. Here the chance constraints are satisfied over all possible probability distributions that belong to an ambiguity set. We use a stochastic bin packing model as an illustrative example. A bin packing problem allocates items of a certain size to a bin of a fixed capacity while minimizing the total allocation cost. The study of distributional robustness in chance-constrained is a topic of recent development. In a chance-constrained packing problem, we allocate items to a bin so that the bin capacity exceeds only with the desired probability. This chapter also describes a probability cut-based algorithm for solving such problems and presents computational results for their effectiveness. The computational results are presented using an ambiguity set of distributions described using the Wasserstein metric. The value of using an ambiguity set in improving the out-of-sample performance for satisfying the chance constraint is also illustrated.

Suggested Citation

  • Shanshan Wang & Mohsen Mohammadi & Sanjay Mehrotra, 2024. "Modeling and Solving Robust Chance-Constrained Binary Programs Using Sample Average Approximations," International Series in Operations Research & Management Science, in: Faiz Hamid (ed.), Optimization Essentials, chapter 0, pages 501-524, Springer.
    • Handle: RePEc:spr:isochp:978-981-99-5491-9_16
    DOI: 10.1007/978-981-99-5491-9_16
    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:isochp:978-981-99-5491-9_16. 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.