IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v48y2000i1p91-98.html
   My bibliography  Save this article

Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs

Author

Listed:
  • Samer Takriti

    (Mathematical Sciences Department, IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598)

  • John R. Birge

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117)

Abstract

Many production problems involve facility setups that lead to integer variables, production decisions that are continuous, and demands that are likely to be random. While these problems can be quite difficult to solve, we propose a model and an efficient solution technique for this basic class of stochastic mixed-integer programs. We use a set of scenarios to reflect uncertainty. The resulting mathematical model is solved using Lagrangian relaxation. We show that the duality gap of our relaxation is bounded above by a constant that depends on the cost function and the number of branching points in the scenario tree. We apply our technique to the problem of generating electric power. Numerical results indicate significant savings when the stochastic model is used instead of a deterministic one.

Suggested Citation

  • Samer Takriti & John R. Birge, 2000. "Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs," Operations Research, INFORMS, vol. 48(1), pages 91-98, February.
    • Handle: RePEc:inm:oropre:v:48:y:2000:i:1:p:91-98
    DOI: 10.1287/opre.48.1.91.12450
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.48.1.91.12450
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.48.1.91.12450?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
    ---><---

    References listed on IDEAS

    as
    1. B.J. Lageweg & J.K Lenstra & A.H.G. RinnooyKan & L. Stougie & A.H.G. Rinnooy Kan, 1985. "Stochastic Integer Programming By Dynamic Programming," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 39(2), pages 97-113, June.
    2. SCHULTZ, Rüdiger & STOUGIE, Leen & van der VLERK, Maarten, 1995. "Solving Stochastic Programs with Complete Integer Recourse : A Framework Using Gröbner Bases," LIDAM Discussion Papers CORE 1995062, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    4. John M. Mulvey & Andrzej Ruszczyński, 1995. "A New Scenario Decomposition Method for Large-Scale Stochastic Optimization," Operations Research, INFORMS, vol. 43(3), pages 477-490, June.
    5. John A. Muckstadt & Sherri A. Koenig, 1977. "An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems," Operations Research, INFORMS, vol. 25(3), pages 387-403, June.
    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. Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Merino Maestre, María & Pérez Sainz de Rozas, Gloria, 2005. "A two-stage stochastic integer programming approach," BILTOKI 1134-8984, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    2. Serhat Gul & Brian T. Denton & John W. Fowler, 2015. "A Progressive Hedging Approach for Surgery Planning Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 755-772, November.
    3. M A Lejeune, 2008. "Preprocessing techniques and column generation algorithms for stochastically efficient demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1239-1252, September.
    4. Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Pérez Sainz de Rozas, Gloria & Unzueta Inchaurbe, Aitziber, 2010. "Lagrangean decomposition for large-scale two-stage stochastic mixed 0-1 problems," BILTOKI 1134-8984, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    5. Borodin, Valeria & Bourtembourg, Jean & Hnaien, Faicel & Labadie, Nacima, 2015. "A multi-step rolled forward chance-constrained model and a proactive dynamic approach for the wheat crop quality control problem," European Journal of Operational Research, Elsevier, vol. 246(2), pages 631-640.
    6. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
    7. L. Escudero & A. Garín & M. Merino & G. Pérez, 2007. "A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes," Annals of Operations Research, Springer, vol. 152(1), pages 395-420, July.
    8. Antonio Frangioni, 2005. "About Lagrangian Methods in Integer Optimization," Annals of Operations Research, Springer, vol. 139(1), pages 163-193, October.
    9. Jiang, Ruiwei & Zhang, Muhong & Li, Guang & Guan, Yongpei, 2014. "Two-stage network constrained robust unit commitment problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 751-762.
    10. L. Escudero & M. Garín & G. Pérez & A. Unzueta, 2012. "Lagrangian Decomposition for large-scale two-stage stochastic mixed 0-1 problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(2), pages 347-374, July.
    11. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    12. Eguía Ribero, María Isabel & Garín Martín, María Araceli & Unzueta Inchaurbe, Aitziber, 2018. "Generating cluster submodels from two-stage stochastic mixed integer optimization models," BILTOKI 31248, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    13. Steeger, Gregory & Rebennack, Steffen, 2017. "Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem," European Journal of Operational Research, Elsevier, vol. 257(2), pages 669-686.
    14. Escudero, Laureano F. & Landete, Mercedes & Rodríguez-Chía, Antonio M., 2011. "Stochastic set packing problem," European Journal of Operational Research, Elsevier, vol. 211(2), pages 232-240, June.

    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. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    2. Cooper, W. W. & Hemphill, H. & Huang, Z. & Li, S. & Lelas, V. & Sullivan, D. W., 1997. "Survey of mathematical programming models in air pollution management," European Journal of Operational Research, Elsevier, vol. 96(1), pages 1-35, January.
    3. Jesús Latorre & Santiago Cerisola & Andrés Ramos & Rafael Palacios, 2009. "Analysis of stochastic problem decomposition algorithms in computational grids," Annals of Operations Research, Springer, vol. 166(1), pages 355-373, February.
    4. Julia Higle & Suvrajeet Sen, 2006. "Multistage stochastic convex programs: Duality and its implications," Annals of Operations Research, Springer, vol. 142(1), pages 129-146, February.
    5. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    6. Panos Parpas & Berç Rustem, 2007. "Computational Assessment of Nested Benders and Augmented Lagrangian Decomposition for Mean-Variance Multistage Stochastic Problems," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 239-247, May.
    7. Manuel Laguna, 1998. "Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty," Management Science, INFORMS, vol. 44(11-Part-2), pages 101-110, November.
    8. Jie Sun & Xinwei Liu, 2006. "Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 444-454, November.
    9. Dimitris Bertsimas & Omid Nohadani & Kwong Meng Teo, 2010. "Robust Optimization for Unconstrained Simulation-Based Problems," Operations Research, INFORMS, vol. 58(1), pages 161-178, February.
    10. Siva Sankaran & Tung Bui, 2008. "An organizational model for transitional negotiations: concepts, design and applications," Group Decision and Negotiation, Springer, vol. 17(2), pages 157-173, March.
    11. Samer Takriti & Benedikt Krasenbrink & Lilian S.-Y. Wu, 2000. "Incorporating Fuel Constraints and Electricity Spot Prices into the Stochastic Unit Commitment Problem," Operations Research, INFORMS, vol. 48(2), pages 268-280, April.
    12. K. Kiwiel & C.H. Rosa & A. Ruszczynski, 1995. "Decomposition via Alternating Linearization," Working Papers wp95051, International Institute for Applied Systems Analysis.
    13. Yan, Yongze & Hong, Liu & He, Xiaozheng & Ouyang, Min & Peeta, Srinivas & Chen, Xueguang, 2017. "Pre-disaster investment decisions for strengthening the Chinese railway system under earthquakes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 39-59.
    14. Semih Atakan & Suvrajeet Sen, 2018. "A Progressive Hedging based branch-and-bound algorithm for mixed-integer stochastic programs," Computational Management Science, Springer, vol. 15(3), pages 501-540, October.
    15. Lee, Chungmok, 2022. "A robust optimization approach with probe-able uncertainty," European Journal of Operational Research, Elsevier, vol. 296(1), pages 218-239.
    16. Fudong Xie & Ce Wang & Housheng Duan, 2024. "Optimizing Fleet Size in Point-to-Point Shared Demand Responsive Transportation Service: A Network Decomposition Approach," Mathematics, MDPI, vol. 12(19), pages 1-20, September.
    17. X. W. Liu & M. Fukushima, 2006. "Parallelizable Preprocessing Method for Multistage Stochastic Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 327-346, December.
    18. Chia-Hung Chen & Shangyao Yan & Miawjane Chen, 2010. "Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands," Annals of Operations Research, Springer, vol. 181(1), pages 67-88, December.
    19. Zhang, S., 2002. "An interior-point and decomposition approach to multiple stage stochastic programming," Econometric Institute Research Papers EI 2002-35, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. T. Glenn Bailey & Paul A. Jensen & David P. Morton, 1999. "Response surface analysis of two‐stage stochastic linear programming with recourse," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(7), pages 753-776, October.

    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:inm:oropre:v:48:y:2000:i:1:p:91-98. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.