L-SHAPED ALGORITHM FOR TWO STAGE PROBLEMS OF STOCHASTIC CONVEX PROGRAMMING

  • Tang, Hengyong (Department of Mathematics, Shenyang Normal University) ;
  • Zhao, Yufang (Department of Mathematics, Shenyang Normal University)
  • 발행 : 2003.09.01

초록

In this paper we study two stage problems of stochastic convex programming. Solving the problems is very hard. A L-shaped method for it is given. The implement of the algorithm is simple, so less computation work is needed. The result of computation shows that the algorithm is effective.

키워드

참고문헌

  1. Nonlinear Programming, Theory and Algorithm M.S.Bazaraa;C.M.Shetty
  2. Operations Research v.33 Decomposition and Partitioning Methods for Multistage Stochastic Linear Programming J.R.Birge
  3. Mathematical Programming v.47 A Computer Code for the Multistage Stochastic Linear Programming Problem H.I.Gassmann
  4. Stochastic Linear Programming P.Kall
  5. Stochastic Programming V.V.Kolbin
  6. Mathematical Programming v.15 Piecewise Convex Programs F.V.louveaux
  7. Operations Research v.28 A Solution Method for Multistage Stochastic Programs with Recourse with Application to An Energy Investment Problem F.V.louveaux
  8. Linear and Nonlinear Programming D.G.Luenberger
  9. SIAM Journal and Applied Mathematics v.17 L-shaped Linear Program with Application to Optimal Control and Stochastic Linear Programming R.Van Slyke;R.J.Wets
  10. Numer. Math. J. Chinese Univ. A algorithm for L-shaped Convex Programming Hengyong Tang;Yufang Zhao