Skip to main content
Log in

Analysis and comparisons of some solution concepts for stochastic programming problems

  • Published:
Top Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • 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 

  • Charnes A. and Cooper W.W. (1963). Deterministic Equivalents for Optimizing and Satisfying under Chance Constraints.Operations Research 11, 18–39.

    Article  Google Scholar 

  • Kall P. (1982). Stochastic Programming.European Journal of Operational Research 10, 125–130.

    Article  Google Scholar 

  • Kall P. and Wallace S.W. (1994).Stochastic Programming. John Wiley.

  • Kataoka S. (1963). A Stochastic Programming Model.Econometrica 31, 181–196.

    Article  Google Scholar 

  • Kibzun A.I. and Kan I.S. (1996).Stochastic Programming Problems with Probability and Quantile Functions. John Wiley.

  • Leclerq J.P. (1982). Stochastic Programming: An Interactive Multicriteria Approach.European Journal of Operational Research 10, 33–41.

    Article  Google Scholar 

  • Markowitz H. (1952). Portfolio Selection.The Journal of Finance 7, 77–91.

    Article  Google Scholar 

  • Prékopa A. (1995).Stochastic Programming. Kluwer Academic Publishers.

  • Sawaragi Y., Nakayama H. and Tanino T. (1985).Theory of Multiobjective Optimization. Academic Press.

  • Stancu-Minasian I.M. (1984).Stochastic Programming with Multiple Objective Functions. D. Reidel Publishing Company.

  • Zare Y. and Daneshmand A. (1995). A Linear Approximation method for solving a special class of the chance constrained programming problem.European Journal of Operational Research 80, 213–225.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The work of these authors was supported byMinisterio de Ciencia y Tecnología andConsejería de Educación y Ciencia, Junta de Andalucía.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caballero, R., Cerda, E., Muñoz, M.M. et al. Analysis and comparisons of some solution concepts for stochastic programming problems. Top 10, 101–123 (2002). https://doi.org/10.1007/BF02578943

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02578943

Key Words

AMS subject classification

Navigation