IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v177y2010i1p139-15010.1007-s10479-009-0591-7.html
   My bibliography  Save this article

Convex approximations for a class of mixed-integer recourse models

Author

Listed:
  • Maarten Vlerk

Abstract

We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recourse (SIR) shortage function. This allows to construct convex approximations for MIR problems by the same approach used for SIR models. Copyright The Author(s) 2010

Suggested Citation

  • Maarten Vlerk, 2010. "Convex approximations for a class of mixed-integer recourse models," Annals of Operations Research, Springer, vol. 177(1), pages 139-150, June.
  • Handle: RePEc:spr:annopr:v:177:y:2010:i:1:p:139-150:10.1007/s10479-009-0591-7
    DOI: 10.1007/s10479-009-0591-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0591-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-009-0591-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. KLEIN HANEVELD, W. K. & STOUGIE, L. & van der VLERK, M. H., 1996. "An algorithm for the construction of convex hulls in simple integer recourse programming," LIDAM Reprints CORE 1215, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Willem Klein Haneveld & Maarten van der Vlerk, 1999. "Stochastic integer programming:General models and algorithms," Annals of Operations Research, Springer, vol. 85(0), pages 39-57, January.
    3. repec:dgr:rugsom:03a14 is not listed on IDEAS
    4. Rüdiger Schultz, 1993. "Continuity Properties of Expectation Functions in Stochastic Integer Programming," Mathematics of Operations Research, INFORMS, vol. 18(3), pages 578-589, August.
    5. Caroe, Claus C. & Tind, Jorgen, 1997. "A cutting-plane approach to mixed 0-1 stochastic integer programs," European Journal of Operational Research, Elsevier, vol. 101(2), pages 306-316, September.
    6. Stougie, Leen & Vlerk, Maarten H. van der, 2003. "Approximation in stochastic integer programming," Research Report 03A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ilke Bakir & Natashia Boland & Brian Dandurand & Alan Erera, 2020. "Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 145-163, January.
    2. Ward Romeijnders & Niels van der Laan, 2020. "Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty," Operations Research, INFORMS, vol. 68(4), pages 1199-1217, July.
    3. Francesca Maggioni & Elisabetta Allevi & Marida Bertocchi, 2016. "Monotonic bounds in multistage mixed-integer stochastic programming," Computational Management Science, Springer, vol. 13(3), pages 423-457, July.
    4. Weijun Xie & Shabbir Ahmed, 2018. "Distributionally robust simple integer recourse," Computational Management Science, Springer, vol. 15(3), pages 351-367, October.
    5. Ward Romeijnders & David P. Morton & Maarten H. van der Vlerk, 2017. "Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 211-231, May.
    6. David P. Morton & Ward Romeijnders & Rüdiger Schultz & Leen Stougie, 2018. "The stochastic programming heritage of Maarten van der Vlerk," Computational Management Science, Springer, vol. 15(3), pages 319-323, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brian Keller & Güzin Bayraksan, 2012. "Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 172-186, February.
    2. Albareda-Sambola, Maria & Vlerk, Maarten H. van der & Fernandez, Elena, 2002. "Exact solutions to a class of stochastic generalized assignment problems," Research Report 02A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    3. repec:dgr:rugsom:02a11 is not listed on IDEAS
    4. Lewis Ntaimo, 2010. "Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse," Operations Research, INFORMS, vol. 58(1), pages 229-243, February.
    5. Klein Haneveld, Willem K. & Stougie, Leen & Vlerk, Maarten H. van der, 2004. "Simple Integer Recourse Models: Convexity and Convex Approximations," Research Report 04A21, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    6. Vlerk, Maarten H. van der, 2004. "Convex approximations for a class of mixed-integer recourse models," Research Report 04A28, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    7. Stougie, Leen & Vlerk, Maarten H. van der, 2003. "Approximation in stochastic integer programming," Research Report 03A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    8. repec:dgr:rugsom:03a14 is not listed on IDEAS
    9. Lewis Ntaimo, 2013. "Fenchel decomposition for stochastic mixed-integer programming," Journal of Global Optimization, Springer, vol. 55(1), pages 141-163, January.
    10. Vlerk, Maarten H. van der, 2002. "Convex approximations for complete integer recourse models," Research Report 02A21, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    11. repec:dgr:rugsom:02a21 is not listed on IDEAS
    12. repec:dgr:rugsom:04a28 is not listed on IDEAS
    13. Vlerk, Maarten H. van der, 2003. "Simplification of recourse models by modification of recourse data," Research Report 03A01, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    14. repec:dgr:rugsom:04a21 is not listed on IDEAS
    15. Albareda-Sambola, Maria & van der Vlerk, Maarten H. & Fernandez, Elena, 2006. "Exact solutions to a class of stochastic generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 173(2), pages 465-487, September.
    16. Manish Bansal & Yingqiu Zhang, 2021. "Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs," Journal of Global Optimization, Springer, vol. 81(2), pages 391-433, October.
    17. Riis, Morten & Andersen, Kim Allan, 2005. "Applying the minimax criterion in stochastic recourse programs," European Journal of Operational Research, Elsevier, vol. 165(3), pages 569-584, September.
    18. Klein Haneveld, W.K. & Vlerk, M.H. van der, 2000. "Optimizing electricity distribution using two-stage integer recourse models," Research Report 00A26, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    19. Bjorn P. Berg & Brian T. Denton, 2017. "Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 631-644, November.
    20. Bansal, Manish & Mehrotra, Sanjay, 2019. "On solving two-stage distributionally robust disjunctive programs with a general ambiguity set," European Journal of Operational Research, Elsevier, vol. 279(2), pages 296-307.
    21. Ward Romeijnders & David P. Morton & Maarten H. van der Vlerk, 2017. "Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 211-231, May.
    22. repec:dgr:rugsom:03a21 is not listed on IDEAS
    23. Aakil M. Caunhye & Xiaofeng Nie, 2018. "A Stochastic Programming Model for Casualty Response Planning During Catastrophic Health Events," Transportation Science, INFORMS, vol. 52(2), pages 437-453, March.
    24. Castro, Jordi, 2009. "A stochastic programming approach to cash management in banking," European Journal of Operational Research, Elsevier, vol. 192(3), pages 963-974, February.
    25. Maarten Vlerk, 2005. "On multiple simple recourse models," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(2), pages 225-242, November.
    26. Nesbitt, Peter & Blake, Lewis R. & Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo K. & Newman, Alexandra & Brickey, Andrea, 2021. "Underground mine scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 294(1), pages 340-352.

    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:annopr:v:177:y:2010:i:1:p:139-150:10.1007/s10479-009-0591-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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.