Dissection Methods for Solutions in Chance Constrained Programming Problems Under Discrete Distributions
AbstractUnder 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 16 (1970)
Issue (Month): 11 (July)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Singer, Nico, 2011. "A behavioral portfolio analysis of retirement portfolios," Thuenen-Series of Applied Economic Theory 104, University of Rostock, Institute of Economics.
- Martin Branda, 2013. "On relations between chance constrained and penalty function problems under discrete distributions," Computational Statistics, Springer, vol. 77(2), pages 265-277, April.
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.