Chance-Constrained Equivalents of Some Stochastic Programming Problems

Gifford H. Symonds
Additional contact information
Gifford H. Symonds: University of California

Operations Research, 1968, vol. 16, issue 6, 1152-1159

Abstract: This paper shows that chance-constrained equivalents exist for several stochastic programming problems that are concerned with selecting a decision vector which will optimize the expectation of a random loss function, sometimes subject to deterministic constraints. The equivalent chance-constrained problems are concerned with selecting a decision vector that will optimize a deterministic function subject to one or more probability constraints of the form pr[ y i ≧ ξ i ] ≧ α i , i ∈ I , and sometimes also subject to deterministic constraints. Equivalence is shown for stochastic programming problems with either linear or nonlinear random loss functions, including many stochastic scheduling and inventory problems. Such stochastic programming problems may be converted to equivalent chance-constrained problems that can be solved in their certainty equivalent form, for example, by the Horizon Method of Stochastic Scheduling.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.6.1152 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:6:p:1152-1159

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().