IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v101y1997i2p317-327.html
   My bibliography  Save this article

The augmented system variant of IPMs in two-stage stochastic linear programming computation

Author

Listed:
  • Meszaros, Csaba

Abstract

No abstract is available for this item.

Suggested Citation

  • Meszaros, Csaba, 1997. "The augmented system variant of IPMs in two-stage stochastic linear programming computation," European Journal of Operational Research, Elsevier, vol. 101(2), pages 317-327, September.
    • Handle: RePEc:eee:ejores:v:101:y:1997:i:2:p:317-327
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00400-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. John R. Birge & Liqun Qi, 1988. "Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming," Management Science, INFORMS, vol. 34(12), pages 1472-1479, December.
    2. Irvin J. Lustig & John M. Mulvey & Tamra J. Carpenter, 1991. "Formulating Two-Stage Stochastic Programs for Interior Point Methods," Operations Research, INFORMS, vol. 39(5), pages 757-770, October.
    3. J. Gondzio, 1994. "Preconditioned Conjugate Gradients in an Interior Point Method for Two-stage Stochastic Programming," Working Papers wp94130, International Institute for Applied Systems Analysis.
    4. Uwe H. Suhl & Leena M. Suhl, 1990. "Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases," INFORMS Journal on Computing, INFORMS, vol. 2(4), pages 325-335, November.
    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. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    2. Arjan Berkelaar & Cees Dert & Bart Oldenkamp & Shuzhong Zhang, 2002. "A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming," Operations Research, INFORMS, vol. 50(5), pages 904-915, October.
    3. J. Gondzio, 1994. "Preconditioned Conjugate Gradients in an Interior Point Method for Two-stage Stochastic Programming," Working Papers wp94130, International Institute for Applied Systems Analysis.
    4. Diana Barro & Elio Canestrelli, 2005. "Time and nodal decomposition with implicit non-anticipativity constraints in dynamic portfolio optimization," GE, Growth, Math methods 0510011, University Library of Munich, Germany.
    5. A. Ruszczynski, 1993. "Interior Point Methods in Stochastic Programming," Working Papers wp93008, International Institute for Applied Systems Analysis.
    6. 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.
    7. P. Beraldi & D. Conforti & A. Violi, 2009. "SICOpt: Solution Approach for Nonlinear Integer Stochastic Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 143(1), pages 17-36, October.
    8. Mulvey, John M. & Rosenbaum, Daniel P. & Shetty, Bala, 1997. "Strategic financial risk management and operations research," European Journal of Operational Research, Elsevier, vol. 97(1), pages 1-16, February.
    9. Hong‐Chih Huang, 2010. "Optimal Multiperiod Asset Allocation: Matching Assets to Liabilities in a Discrete Model," Journal of Risk & Insurance, The American Risk and Insurance Association, vol. 77(2), pages 451-472, June.
    10. Jacek Gondzio & Andreas Grothey, 2009. "Exploiting structure in parallel implementation of interior point methods for optimization," Computational Management Science, Springer, vol. 6(2), pages 135-160, May.
    11. Paparrizos, Konstantinos & Samaras, Nikolaos & Stephanides, George, 2003. "An efficient simplex type algorithm for sparse and dense linear programs," European Journal of Operational Research, Elsevier, vol. 148(2), pages 323-334, July.
    12. Maqsood, Imran & Huang, Guo H. & Scott Yeomans, Julian, 2005. "An interval-parameter fuzzy two-stage stochastic program for water resources management under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 208-225, November.
    13. Cosmin Petra & Mihai Anitescu, 2012. "A preconditioning technique for Schur complement systems arising in stochastic optimization," Computational Optimization and Applications, Springer, vol. 52(2), pages 315-344, June.
    14. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    15. Kuang-Yu Ding & Xin-Yee Lam & Kim-Chuan Toh, 2023. "On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems," Computational Optimization and Applications, Springer, vol. 86(1), pages 117-161, September.
    16. Ricardo Fukasawa & Laurent Poirrier, 2019. "Permutations in the Factorization of Simplex Bases," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 612-632, July.
    17. Sanjay Mehrotra & M. Gokhan Ozevin, 2009. "Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse," Operations Research, INFORMS, vol. 57(4), pages 964-974, August.
    18. Fabio Vitor & Todd Easton, 2018. "The double pivot simplex method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 109-137, February.
    19. Escudero, L. F. & Fuente, J. L. de la & García, C. & Prieto, Francisco J., 1996. "A parallel computation approach for solving multistage stochastic network problems," DES - Working Papers. Statistics and Econometrics. WS 10455, Universidad Carlos III de Madrid. Departamento de Estadística.
    20. Tiago Andrade & Nikita Belyak & Andrew Eberhard & Silvio Hamacher & Fabricio Oliveira, 2022. "The p-Lagrangian relaxation for separable nonconvex MIQCQP problems," Journal of Global Optimization, Springer, vol. 84(1), pages 43-76, September.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:101:y:1997:i:2:p:317-327. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.