메뉴 건너뛰기




Volumn 33, Issue , 2014, Pages 241-246

A Novel Cross-decomposition Multi-cut Scheme for Two-Stage Stochastic Programming

Author keywords

Cross decomposition; Investment planning; Stochastic programming

Indexed keywords


EID: 84902959280     PISSN: 15707946     EISSN: None     Source Type: Book Series    
DOI: 10.1016/B978-0-444-63456-6.50041-7     Document Type: Chapter
Times cited : (5)

References (19)
  • 1
    • 9644308639 scopus 로고
    • Partitioning Procedures for Solving Mixed-variables Programming Problems
    • Benders J. Partitioning Procedures for Solving Mixed-variables Programming Problems. Numer Math 1962, 4:238-252.
    • (1962) Numer Math , vol.4 , pp. 238-252
    • Benders, J.1
  • 3
    • 0032674969 scopus 로고    scopus 로고
    • Dual Decomposition in Stochastic Integer Programming
    • Caroe C.C., Schultz R. Dual Decomposition in Stochastic Integer Programming. Oper Res Lett 1999, 24:37-45.
    • (1999) Oper Res Lett , vol.24 , pp. 37-45
    • Caroe, C.C.1    Schultz, R.2
  • 4
    • 25444456610 scopus 로고    scopus 로고
    • About Langrangian Methods in Integer Optimization
    • Frangioni A. About Langrangian Methods in Integer Optimization. Ann Oper Res 2005, 139:163-193.
    • (2005) Ann Oper Res , vol.139 , pp. 163-193
    • Frangioni, A.1
  • 6
    • 0015419856 scopus 로고
    • Generalized Benders Decomposition
    • Geoffrion A. Generalized Benders Decomposition. J Optimiz Theory App 1972, 10:237-260.
    • (1972) J Optimiz Theory App , vol.10 , pp. 237-260
    • Geoffrion, A.1
  • 7
    • 0023451776 scopus 로고
    • Lagrangean Decomposition - a Model Yielding Stronger Lagrangean Bounds
    • Guignard M., Kim S. Lagrangean Decomposition - a Model Yielding Stronger Lagrangean Bounds. Math Program 1987, 39:215-228.
    • (1987) Math Program , vol.39 , pp. 215-228
    • Guignard, M.1    Kim, S.2
  • 8
    • 0037321577 scopus 로고    scopus 로고
    • Scenario Reduction Algorithms in Stochastic Programming
    • Heitsch H., Romisch W. Scenario Reduction Algorithms in Stochastic Programming. Comput Optim Appl 2003, 24:187-206.
    • (2003) Comput Optim Appl , vol.24 , pp. 187-206
    • Heitsch, H.1    Romisch, W.2
  • 9
    • 34249957342 scopus 로고
    • On the Convergence of Cross Decomposition
    • Holmberg K. On the Convergence of Cross Decomposition. Math Program 1990, 47:269-296.
    • (1990) Math Program , vol.47 , pp. 269-296
    • Holmberg, K.1
  • 10
    • 0027116020 scopus 로고    scopus 로고
    • Linear Mean Value Cross Decomposition: A Generalization of the Kornai-Liptak Method
    • Holmberg K. Linear Mean Value Cross Decomposition: A Generalization of the Kornai-Liptak Method. Eur J Oper Res 1997, 62:55-73.
    • (1997) Eur J Oper Res , vol.62 , pp. 55-73
    • Holmberg, K.1
  • 11
    • 0031075080 scopus 로고    scopus 로고
    • Mean Value Cross Decomposition Applied to Integer Programming Problems
    • Holmberg K. Mean Value Cross Decomposition Applied to Integer Programming Problems. Eur J Oper Res 1997, 97:124-138.
    • (1997) Eur J Oper Res , vol.97 , pp. 124-138
    • Holmberg, K.1
  • 12
    • 0025208765 scopus 로고
    • Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization
    • Kiwiel K. Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization. Math Program 1990, 46:105-122.
    • (1990) Math Program , vol.46 , pp. 105-122
    • Kiwiel, K.1
  • 13
    • 0344362809 scopus 로고
    • An Algorithm for Minimizing Convex Functions
    • Lemarechal C. An Algorithm for Minimizing Convex Functions. Proceedings IFIP'74 Congress 1974, 552-556.
    • (1974) Proceedings IFIP'74 Congress , pp. 552-556
    • Lemarechal, C.1
  • 14
    • 33644697284 scopus 로고    scopus 로고
    • The Empirical Behavior of Sampling Methods for Stochastic Programming
    • Linderoth J., Shapiro A., Wright S. The Empirical Behavior of Sampling Methods for Stochastic Programming. Ann Oper Res 2006, 142:215-241.
    • (2006) Ann Oper Res , vol.142 , pp. 215-241
    • Linderoth, J.1    Shapiro, A.2    Wright, S.3
  • 15
    • 84902977177 scopus 로고    scopus 로고
    • Optimal Multi-scale Demand-side Management for Continuous Powerintensive Processes
    • Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
    • Mitra S., Mitra P. Optimal Multi-scale Demand-side Management for Continuous Powerintensive Processes. Ph.D. thesis 2013, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA.
    • (2013) Ph.D. thesis
    • Mitra, S.1    Mitra, P.2
  • 17
    • 0020588728 scopus 로고
    • Cross Decomposition for Mixed Integer Programming
    • Van Roy T.J. Cross Decomposition for Mixed Integer Programming. Math Program 1983, 25:46-63.
    • (1983) Math Program , vol.25 , pp. 46-63
    • Van Roy, T.J.1
  • 18
    • 0014534894 scopus 로고
    • L-shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
    • Van Slyke R., Wets R. L-shaped Linear Programs with Applications to Optimal Control and Stochastic Programming. SIAM J Appl Math 1969, 17:638-663.
    • (1969) SIAM J Appl Math , vol.17 , pp. 638-663
    • Van Slyke, R.1    Wets, R.2


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