Analysis and comparisons of some solution concepts for stochastic programming problems

1. R. Caballero
2. E. Cerdá
3. M. M. Muñoz

Exportar

Exportar

×

MLA

modern-language-association

APA

apa

Chicago

chicago-fullnote-bibliography

Harvard

harvard-cite-them-right

Vancouver

vancouver-author-date

---

RIS BibTex

Exportar

×

El documento no se puede exportar porque pertenece a otro portal.

Texto completo

lock_openDocta Complutense externo

DIALNET GOOGLE SCHOLAR lock_openDocta Complutense editor

Otras publicaciones en: Documentos de Trabajo (ICAE)

Resumen

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.

Fuente de los datos: Dialnet