IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v4y2007i4p313-353.html
   My bibliography  Save this article

Solving two-stage stochastic programming problems with level decomposition

Author

Listed:
  • Csaba Fábián
  • Zoltán Szőke

Abstract

No abstract is available for this item.

Suggested Citation

  • Csaba Fábián & Zoltán Szőke, 2007. "Solving two-stage stochastic programming problems with level decomposition," Computational Management Science, Springer, vol. 4(4), pages 313-353, October.
    • Handle: RePEc:spr:comgts:v:4:y:2007:i:4:p:313-353
    DOI: 10.1007/s10287-006-0026-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-006-0026-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10287-006-0026-8?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. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    2. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    3. Maros, Istvan, 2003. "A generalized dual phase-2 simplex algorithm," European Journal of Operational Research, Elsevier, vol. 149(1), pages 1-16, August.
    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. A. Gouda & T. Szántai, 2008. "Rare event probabilities in stochastic networks," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(4), pages 441-461, December.
    2. Béla Vizvári & Zoltán Lakner & Zsolt Csizmadia & Gergely Kovács, 2011. "A stochastic programming and simulation based analysis of the structure of production on the arable land," Annals of Operations Research, Springer, vol. 190(1), pages 325-337, 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. Ketabchi, Saeed & Behboodi-Kahoo, Malihe, 2015. "Augmented Lagrangian method within L-shaped method for stochastic linear programs," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 12-20.
    2. Richard W. Cottle, 2005. "George B. Dantzig: Operations Research Icon," Operations Research, INFORMS, vol. 53(6), pages 892-898, December.
    3. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    4. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    5. Fan, Wei & Machemehl, Randy, 2004. "A Multi-stage Monte Carlo Sampling Based Stochastic Programming Model for the Dynamic Vehicle Allocation Problem," 45th Annual Transportation Research Forum, Evanston, Illinois, March 21-23, 2004 208244, Transportation Research Forum.
    6. Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
    7. Fan, Wei, 2014. "Optimizing Strategic Allocation of Vehicles for One-Way Car-sharing Systems Under Demand Uncertainty," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 53(3).
    8. Sinuany-Stern, Zilla, 2023. "Foundations of operations research: From linear programming to data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1069-1080.
    9. A. Ruszczynski, 1993. "Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results," Working Papers wp93021, International Institute for Applied Systems Analysis.
    10. Ethem Çanakoğlu & İbrahim Muter & Tevfik Aytekin, 2021. "Integrating Individual and Aggregate Diversity in Top- N Recommendation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 300-318, January.
    11. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    12. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    13. Metrane, Abdelmoutalib & Soumis, François & Elhallaoui, Issmail, 2010. "Column generation decomposition with the degenerate constraints in the subproblem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 37-44, November.
    14. Belanger, Nicolas & Desaulniers, Guy & Soumis, Francois & Desrosiers, Jacques, 2006. "Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1754-1766, December.
    15. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    16. J. F. F. Almeida & S. V. Conceição & L. R. Pinto & B. R. P. Oliveira & L. F. Rodrigues, 2022. "Optimal sales and operations planning for integrated steel industries," Annals of Operations Research, Springer, vol. 315(2), pages 773-790, August.
    17. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    18. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    19. Ternoy, Jacques Emmanuel, 1969. "Cooperation and economic efficiency," ISU General Staff Papers 196901010800004786, Iowa State University, Department of Economics.
    20. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.

    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:comgts:v:4:y:2007:i:4:p:313-353. 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.