메뉴 건너뛰기




Volumn 18, Issue 4, 2006, Pages 444-454

Scenario formulation of stochastic linear programs and the homogeneous self-dual interior-point method

Author keywords

Decomposition; Interior point methods; Multistage stochastic linear programs

Indexed keywords


EID: 33847050318     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0112     Document Type: Article
Times cited : (6)

References (25)
  • 1
    • 0001614864 scopus 로고    scopus 로고
    • The MOSEK interior point optimizer for linear programming: An implementation of the homogeneous algorithm
    • J. B. G. Frenk, K. Roos, T. Terlaky, S. Zhang, eds, Kluwer Academic Publishers, Boston, MA
    • Anderson, E. D., K. D. Anderson. 1999. The MOSEK interior point optimizer for linear programming: An implementation of the homogeneous algorithm. J. B. G. Frenk, K. Roos, T. Terlaky, S. Zhang, eds. High Performance Optimization Techniques. Kluwer Academic Publishers, Boston, MA, 197-232.
    • (1999) High Performance Optimization Techniques , pp. 197-232
    • Anderson, E.D.1    Anderson, K.D.2
  • 2
    • 0001577766 scopus 로고    scopus 로고
    • On a homogeneous algorithm for the monotone complementarity problem
    • Anderson, E. D., Y. Ye. 1999. On a homogeneous algorithm for the monotone complementarity problem. Math. Programming 84 375-400.
    • (1999) Math. Programming , vol.84 , pp. 375-400
    • Anderson, E.D.1    Ye, Y.2
  • 3
    • 0036759227 scopus 로고    scopus 로고
    • A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming
    • Berkelaar, A., C. Dert, B. Oldenkamp, S. Zhang. 2002. A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming. Oper. Res. 50 904-915.
    • (2002) Oper. Res , vol.50 , pp. 904-915
    • Berkelaar, A.1    Dert, C.2    Oldenkamp, B.3    Zhang, S.4
  • 4
    • 1542352143 scopus 로고    scopus 로고
    • A primal-dual decomposition algorithm for multistage stochastic convex programming
    • Technical report SEEM2000-07, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong
    • Berkelaar, A., R. Kouwenberg, S. Zhang. 2000. A primal-dual decomposition algorithm for multistage stochastic convex programming. Technical report SEEM2000-07, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong.
    • (2000)
    • Berkelaar, A.1    Kouwenberg, R.2    Zhang, S.3
  • 6
    • 0036883837 scopus 로고    scopus 로고
    • A Riccati-based primal interior point solver for multistage stochastic programming
    • Blomvall, J., P. O. Lindberg. 2002. A Riccati-based primal interior point solver for multistage stochastic programming. Eur. J. Oper. Res. 143 452-461.
    • (2002) Eur. J. Oper. Res , vol.143 , pp. 452-461
    • Blomvall, J.1    Lindberg, P.O.2
  • 7
    • 21844501022 scopus 로고
    • Scenario analysis via bundle decomposition
    • Chun, B. J., S. M. Robinson. 1995. Scenario analysis via bundle decomposition. Ann. Oper. Res. 56 39-63.
    • (1995) Ann. Oper. Res , vol.56 , pp. 39-63
    • Chun, B.J.1    Robinson, S.M.2
  • 8
    • 0343691647 scopus 로고
    • Approximate scenario solutions in the progressive hedging algorithm
    • Helgason, T., S. W. Wallace. 1991. Approximate scenario solutions in the progressive hedging algorithm. Ann. Oper. Res. 31 425-444.
    • (1991) Ann. Oper. Res , vol.31 , pp. 425-444
    • Helgason, T.1    Wallace, S.W.2
  • 10
    • 0002279598 scopus 로고
    • Stochastic programming problems: Examples from the literature
    • Y. Ermoliev, R. J.-B. Wets, eds, Springer-Verlag, Berlin, Germany
    • King, A. J. 1988. Stochastic programming problems: Examples from the literature. Y. Ermoliev, R. J.-B. Wets, eds. Numerical Techniques for Stochastic Optimization. Springer-Verlag, Berlin, Germany, 543-567.
    • (1988) Numerical Techniques for Stochastic Optimization , pp. 543-567
    • King, A.J.1
  • 11
    • 1542315959 scopus 로고    scopus 로고
    • A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods
    • Liu, X. W., J. Sun. 2004. A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods. J. Global Optim. 28 197-215.
    • (2004) J. Global Optim , vol.28 , pp. 197-215
    • Liu, X.W.1    Sun, J.2
  • 12
    • 0000022796 scopus 로고
    • On implementing Mehrotra's predictor-corrector interior-point method for linear programming
    • Lustig, I. J., R. E. Marsten, D. F. Shanno. 1992. On implementing Mehrotra's predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2 435-449.
    • (1992) SIAM J. Optim , vol.2 , pp. 435-449
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 13
    • 0000561116 scopus 로고
    • On the implementation of a primal-dual interior point method
    • Mehrotra, S. 1992. On the implementation of a primal-dual interior point method. SIAM J. Optim. 2 575-601.
    • (1992) SIAM J. Optim , vol.2 , pp. 575-601
    • Mehrotra, S.1
  • 14
    • 0000937493 scopus 로고
    • A new scenario decomposition method for large-scale stochastic optimization
    • Mulvey, J. M., A. Ruszczyński. 1995. A new scenario decomposition method for large-scale stochastic optimization. Oper, Res. 43 477-490.
    • (1995) Oper, Res , vol.43 , pp. 477-490
    • Mulvey, J.M.1    Ruszczyński, A.2
  • 15
    • 0000514655 scopus 로고
    • Scenarios and policy aggregation in optimization under uncertainty
    • Rockafellar, R. T., R. J.-B. Wets. 1991. Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16 119-147.
    • (1991) Math. Oper. Res , vol.16 , pp. 119-147
    • Rockafellar, R.T.1    Wets, R.J.-B.2
  • 16
    • 0000365133 scopus 로고    scopus 로고
    • Decomposition methods in stochastic programming
    • Ruszczyński, A. 1997. Decomposition methods in stochastic programming. Math. Programming 79 333-353.
    • (1997) Math. Programming , vol.79 , pp. 333-353
    • Ruszczyński, A.1
  • 17
    • 0012712209 scopus 로고    scopus 로고
    • Hierarchical sparsity in multistage convex stochastic programs
    • S. P. Uryasev, P. M. Pardalos, eds, Kluwer Academic Publishers, Boston, MA
    • Steinbach, M. C. 2001. Hierarchical sparsity in multistage convex stochastic programs. S. P. Uryasev, P. M. Pardalos, eds. Stochastic Optimization: Algorithms and Applications. Kluwer Academic Publishers, Boston, MA, 385-410.
    • (2001) Stochastic Optimization: Algorithms and Applications , pp. 385-410
    • Steinbach, M.C.1
  • 18
    • 0013695060 scopus 로고
    • An interior point method for solving a class of linear-quadratic stochastic programming problems
    • L. Qi, R. Womersley, eds, World Scientific Publishing, River Edge, NJ
    • Sun, J., K. E. Wee, J. S. Zhu. 1995. An interior point method for solving a class of linear-quadratic stochastic programming problems. L. Qi, R. Womersley, eds. Recent Advances in Nonsmooth Optimization. World Scientific Publishing, River Edge, NJ, 392-404.
    • (1995) Recent Advances in Nonsmooth Optimization , pp. 392-404
    • Sun, J.1    Wee, K.E.2    Zhu, J.S.3
  • 20
    • 21344457406 scopus 로고    scopus 로고
    • A simplified homogeneous and self-dual linear programming algorithm and its implementation
    • Xu, X., P. Hung, Y. Ye. 1996. A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62 151-171.
    • (1996) Ann. Oper. Res , vol.62 , pp. 151-171
    • Xu, X.1    Hung, P.2    Ye, Y.3
  • 21
    • 0030715517 scopus 로고    scopus 로고
    • A scalable parallel interior point algorithm for stochastic linear programming and robust optimization
    • Yang, D., S. A. Zenios. 1997. A scalable parallel interior point algorithm for stochastic linear programming and robust optimization. Computational Optim. Appl. 7 143-158.
    • (1997) Computational Optim. Appl , vol.7 , pp. 143-158
    • Yang, D.1    Zenios, S.A.2
  • 23
    • 0003058678 scopus 로고
    • An O(√nL)-iteration homogeneous and self-dual linear programming algorithm
    • Ye, Y., M. J. Todd, S. Mizuno. 1994. An O(√nL)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19 53-67.
    • (1994) Math. Oper. Res , vol.19 , pp. 53-67
    • Ye, Y.1    Todd, M.J.2    Mizuno, S.3
  • 24
    • 0032303559 scopus 로고    scopus 로고
    • Solving large-scale linear programs by interiorpoint methods under the MATLAB environment
    • Zhang, Y. 1998. Solving large-scale linear programs by interiorpoint methods under the MATLAB environment. Optim. Methods Software 10 1-31.
    • (1998) Optim. Methods Software , vol.10 , pp. 1-31
    • Zhang, Y.1
  • 25
    • 0011617062 scopus 로고    scopus 로고
    • A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
    • Zhao, G. Y. 2001. A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs. Math. Programming 90 507-536.
    • (2001) Math. Programming , vol.90 , pp. 507-536
    • Zhao, G.Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.