• 대한수학회보
• /
• 제32권2호
• /
• pp.287-296
• /
• 1995

Wets ([4],[5],[6]) considered single objective linear two-stage programming problem under uncertainty with complete recourse. Artstein, Dupacova, Romisch, Schultz and Wets studied stability of this problem id depth. But in many real world problems to make best decision, we need multiple objective functions. So we consider the following multiple objective two-stage programming problems with complete fixed recourse.

• 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.