Dissection Methods for Solutions in Chance Constrained Programming Problems Under Discrete Distributions

William M. Raike
Additional contact information
William M. Raike: The University of Texas at Austin

Management Science, 1970, vol. 16, issue 11, 708-715

Abstract: Under the assumption of discrete distributions for the random variables involved, deterministic equivalent problems are derived for a general class of chance constrained (but not necessarily linear) programming problems. These permit the explicit solution of such problems for all or most types of optimal stochastic decision rules which are of interest, including optimal multistage rules and not restricted to the class of linear rules. The formulation given encompasses certain cases of stochastic programming with recourse, and the deterministic equivalents derived for these reduce to well-known versions available in the literature.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.11.708 (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:ormnsc:v:16:y:1970:i:11:p:708-715

Access Statistics for this article

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