메뉴 건너뛰기




Volumn 59, Issue 3, 2010, Pages 401-415

Numerical evaluation of approximation methods in stochastic programming

Author keywords

Multistage stochastic programming; Out of sample evaluation; Scenario tree

Indexed keywords


EID: 77952493106     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331931003700756     Document Type: Article
Times cited : (6)

References (19)
  • 1
    • 31144445025 scopus 로고    scopus 로고
    • The scenario generation algorithm for multistage stochastic linear programming
    • M.S. Casey and S. Sen, The scenario generation algorithm for multistage stochastic linear programming, Math. Oper. Res. 30 (2005), pp. 615-631.
    • (2005) Math. Oper. Res. , vol.30 , pp. 615-631
    • Casey, M.S.1    Sen, S.2
  • 3
    • 33751071102 scopus 로고    scopus 로고
    • Scenarios reduction in stochastic programming: An approach using probability metrics
    • J. Dupačová, N. Gröwe-Kuska, and W. Römisch, Scenarios reduction in stochastic programming: An approach using probability metrics, Math. Prog. 95(A) (2003), pp. 493-511.
    • (2003) Math. Prog. , vol.95 , Issue.A , pp. 493-511
    • Dupačová, J.1    Gröwe-Kuska, N.2    Römisch, W.3
  • 4
    • 58249116102 scopus 로고    scopus 로고
    • Scenario tree modeling for multistage stochastic programmes
    • H. Heitsch and W. Römisch, Scenario tree modeling for multistage stochastic programmes, Math. Prog. 118 (2009), pp. 371-406.
    • (2009) Math. Prog. , vol.118 , pp. 371-406
    • Heitsch, H.1    Römisch, W.2
  • 5
    • 34047209909 scopus 로고    scopus 로고
    • Stability of multistage stochastic programmes
    • H. Heitsch, W. Römisch, and C. Strugarek, Stability of multistage stochastic programmes, SIAM J. Opt. 17 (2006), pp. 511-525.
    • (2006) SIAM J. Opt. , vol.17 , pp. 511-525
    • Heitsch, H.1    Römisch, W.2    Strugarek, C.3
  • 6
    • 67449096622 scopus 로고    scopus 로고
    • Scenario reduction in stochastic programming with respect to discrepancy distances
    • R. Henrion, C. Küchler, and W. Römisch, Scenario reduction in stochastic programming with respect to discrepancy distances, Comput. Opt. Appl. 43 (2009), pp. 67-93.
    • (2009) Comput. Opt. Appl. , vol.43 , pp. 67-93
    • Henrion, R.1    Küchler, C.2    Römisch, W.3
  • 7
    • 47549102808 scopus 로고    scopus 로고
    • Numerical study of discretizations of multistage stochastic programmes
    • P. Hilli and T. Pennanen, Numerical study of discretizations of multistage stochastic programmes, Kybernetika 44 (2008), pp. 185-204.
    • (2008) Kybernetika , vol.44 , pp. 185-204
    • Hilli, P.1    Pennanen, T.2
  • 8
    • 0035261934 scopus 로고    scopus 로고
    • Generating scenario trees for multistage decision problems
    • K. Hoyland and S.W. Wallace, Generating scenario trees for multistage decision problems, Manag. Sci. 47 (2001), pp. 295-307.
    • (2001) Manag. Sci. , vol.47 , pp. 295-307
    • Hoyland, K.1    Wallace, S.W.2
  • 9
    • 57349126254 scopus 로고    scopus 로고
    • ILOG, Inc. (now IBM)
    • ILOG, Inc. (now IBM), CPLEX 10.0, 2006.
    • (2006) CPLEX 10.0
  • 10
    • 34248677663 scopus 로고    scopus 로고
    • Evaluation of scenario-generation methods for stochastic programming
    • M. Kaut and S.W. Wallace, Evaluation of scenario-generation methods for stochastic programming, Pac. J. Opt. 3 (2007), pp. 257-271.
    • (2007) Pac. J. Opt. , vol.3 , pp. 257-271
    • Kaut, M.1    Wallace, S.W.2
  • 11
    • 67649510619 scopus 로고    scopus 로고
    • On stability of multistage stochastic programmes
    • C. Küchler, On stability of multistage stochastic programmes, SIAM J. Opt. 19 (2008), pp. 952-968.
    • (2008) SIAM J. Opt. , vol.19 , pp. 952-968
    • Küchler, C.1
  • 12
    • 77952504802 scopus 로고    scopus 로고
    • C. Küchler and S. Vigerske Decomposition of multistage stochastic programmes with recombining scenario Stochastic Programming E-Print Series 9, 2007.
    • (2007)
    • Küchler, C.1
  • 13
    • 47549084766 scopus 로고    scopus 로고
    • Tree approximations of dynamic stochastic programmes
    • R. Mirkov and G.Ch. Pflug, Tree approximations of dynamic stochastic programmes, SIAM J. Opt. 18 (2007), pp. 1082-1105.
    • (2007) SIAM J. Opt. , vol.18 , pp. 1082-1105
    • Mirkov, R.1    Pflug, G.C.2
  • 14
    • 31144478032 scopus 로고    scopus 로고
    • Epi-convergent discretizations of multistage stochastic programmes
    • T. Pennanen, Epi-convergent discretizations of multistage stochastic programmes, Math. Oper. Res. 30 (2005), pp. 245-256.
    • (2005) Math. Oper. Res. , vol.30 , pp. 245-256
    • Pennanen, T.1
  • 15
    • 0013270047 scopus 로고    scopus 로고
    • Scenario tree generation for multiperiod financial optimization by optimal discretization
    • G.Ch. Pflug, Scenario tree generation for multiperiod financial optimization by optimal discretization, Math. Prog. 89 (2001), pp. 251-271.
    • (2001) Math. Prog. , vol.89 , pp. 251-271
    • Pflug, G.C.1
  • 17
    • 77950485848 scopus 로고    scopus 로고
    • Ch. 3, of Ruszczyński and Shapiro [18]
    • A. Ruszczyński, Decomposition methods, Ch. 3, pp.141-221, Vol. 10 of Ruszczyński and Shapiro [18], 2003.
    • (2003) Decomposition methods , vol.10 , pp. 141-221
    • Ruszczyński, A.1
  • 18
    • 69649105932 scopus 로고    scopus 로고
    • Handbooks in Operations Research and Management Science, Elsevier, Amsterdam
    • A. Ruszczyński and A. Shapiro, Stochastic Programming, Handbooks in Operations Research and Management Science, Vol. 10, Elsevier, Amsterdam, 2003.
    • (2003) Stochastic Programming , vol.10
    • Ruszczyński, A.1    Shapiro, A.2
  • 19
    • 77950512601 scopus 로고    scopus 로고
    • Ch. 6, of Ruszczyński and Shapiro [18]
    • A. Shapiro, Monte Carlo sampling methods, Ch. 6, pp. 353-425, Vol. 10 of Ruszczyński and Shapiro [18], 2003.
    • (2003) Monte Carlo Sampling Methods , vol.10 , pp. 353-425
    • Shapiro, A.1


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