IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v85y2023i1d10.1007_s10589-023-00457-4.html
   My bibliography  Save this article

Integer set reduction for stochastic mixed-integer programming

Author

Listed:
  • Saravanan Venkatachalam

    (Wayne State University)

  • Lewis Ntaimo

    (Texas A & M University)

Abstract

Two-stage stochastic mixed-integer programs (SMIPs) with general integer variables in the second-stage are generally difficult to solve. This paper develops the theory of integer set reduction for characterizing a subset of the convex hull of feasible integer points of the second-stage subproblem which can be used for solving the SMIP with pure integer recourse. The basic idea is to use the smallest possible subset of the subproblem feasible integer set to generate a valid inequality like Fenchel decomposition cuts with a goal of reducing computation time. An algorithm for obtaining such a subset based on the solution of the subproblem linear programming relaxation is devised and incorporated into a decomposition method for SMIP. To demonstrate the performance of the new integer set reduction methodology, a computational study based on randomly generated knapsack test instances was performed. The results of the study show that integer set reduction aids in speeding up cut generation, leading to better bounds in solving SMIPs with pure integer recourse than using a direct solver.

Suggested Citation

  • Saravanan Venkatachalam & Lewis Ntaimo, 2023. "Integer set reduction for stochastic mixed-integer programming," Computational Optimization and Applications, Springer, vol. 85(1), pages 181-211, May.
    • Handle: RePEc:spr:coopap:v:85:y:2023:i:1:d:10.1007_s10589-023-00457-4
    DOI: 10.1007/s10589-023-00457-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00457-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-023-00457-4?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. E. Andrew Boyd, 1994. "Fenchel Cutting Planes for Integer Programs," Operations Research, INFORMS, vol. 42(1), pages 53-64, February.
    2. 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.
    3. 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.
    4. M T Ramos & J Sáez, 2005. "Solving capacitated facility location problems by Fenchel cutting planes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 297-306, March.
    5. Lewis Ntaimo, 2013. "Fenchel decomposition for stochastic mixed-integer programming," Journal of Global Optimization, Springer, vol. 55(1), pages 141-163, January.
    Full references (including those not matched with items on IDEAS)

    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. Onur Tavaslıoğlu & Oleg A. Prokopyev & Andrew J. Schaefer, 2019. "Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function," Operations Research, INFORMS, vol. 67(6), pages 1659-1677, November.
    3. Valicka, Christopher G. & Garcia, Deanna & Staid, Andrea & Watson, Jean-Paul & Hackebeil, Gabriel & Rathinam, Sivakumar & Ntaimo, Lewis, 2019. "Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty," European Journal of Operational Research, Elsevier, vol. 275(2), pages 431-445.
    4. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    5. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
    6. 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.
    7. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    8. Kathryn M. Schumacher & Amy E. M. Cohn & Richard Li-Yang Chen, 2017. "Algorithm for the N -2 Security-Constrained Unit Commitment Problem with Transmission Switching," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 645-659, November.
    9. repec:dgr:rugsom:03a14 is not listed on IDEAS
    10. Dorneles, Árton P. & de Araújo, Olinto C.B. & Buriol, Luciana S., 2017. "A column generation approach to high school timetabling modeled as a multicommodity flow problem," European Journal of Operational Research, Elsevier, vol. 256(3), pages 685-695.
    11. 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.
    12. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    13. Christopher Hojny & Tristan Gally & Oliver Habeck & Hendrik Lüthen & Frederic Matter & Marc E. Pfetsch & Andreas Schmitt, 2020. "Knapsack polytopes: a survey," Annals of Operations Research, Springer, vol. 292(1), pages 469-517, September.
    14. Can Li & Ignacio E. Grossmann, 2019. "A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables," Journal of Global Optimization, Springer, vol. 75(2), pages 247-272, October.
    15. Cheng Guo & Merve Bodur & Dionne M. Aleman & David R. Urbach, 2021. "Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1551-1569, October.
    16. Merve Bodur & Sanjeeb Dash & Oktay Günlük & James Luedtke, 2017. "Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 77-91, February.
    17. José Emmanuel Gómez-Rocha & Eva Selene Hernández-Gress & Héctor Rivera-Gómez, 2021. "Production planning of a furniture manufacturing company with random demand and production capacity using stochastic programming," PLOS ONE, Public Library of Science, vol. 16(6), pages 1-26, June.
    18. 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).
    19. repec:dgr:rugsom:02a11 is not listed on IDEAS
    20. Gyana Parija & Radu Gadidov & Wilbert Wilhelm, 1999. "A Facet Generation Procedure for Solving 0/1 Integer Programs," Operations Research, INFORMS, vol. 47(5), pages 789-791, October.
    21. Lewis Ntaimo, 2013. "Fenchel decomposition for stochastic mixed-integer programming," Journal of Global Optimization, Springer, vol. 55(1), pages 141-163, January.
    22. 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).

    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:coopap:v:85:y:2023:i:1:d:10.1007_s10589-023-00457-4. 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.