Analysis and comparisons of some solution concepts for stochastic programming problems
- 67 Downloads
The aim of this study is to analyse the resolution of Stochastic Programming Problems in which the objective function depends on parameters which are continuous random variables with a known distribution probability. In the literature on these questions different solution concepts have been defined for problems of these characteristics. These concepts are obtained by applying a transformation criterion to the stochastic objective which contains a statistical feature of the objective, implying that for the same stochastic problem there are different optimal solutions available which, in principle, are not comparable. Our study analyses and establishes some relations between these solution concepts.
Key WordsStochastic programming optimal solution concepts
AMS subject classification90C15 90C30
Unable to display preview. Download preview PDF.
- Bereanu B. (1964). Programme de Risque Minimal en Programmation Linéaire Stochastique.Comptes Rendus de l’Academie des Sciences. Serie I, Mathematique 259, 981–983.Google Scholar
- Kall P. and Wallace S.W. (1994).Stochastic Programming. John Wiley.Google Scholar
- Kibzun A.I. and Kan I.S. (1996).Stochastic Programming Problems with Probability and Quantile Functions. John Wiley.Google Scholar
- Prékopa A. (1995).Stochastic Programming. Kluwer Academic Publishers.Google Scholar
- Sawaragi Y., Nakayama H. and Tanino T. (1985).Theory of Multiobjective Optimization. Academic Press.Google Scholar
- Stancu-Minasian I.M. (1984).Stochastic Programming with Multiple Objective Functions. D. Reidel Publishing Company.Google Scholar