Dissection Methods for Solutions in Chance Constrained Programming Problems Under Discrete Distributions
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.
Volume (Year): 16 (1970)
Issue (Month): 11 (July)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:16:y:1970:i:11:p:708-715. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.