• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.261-275
• /
• 2003

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.