On Chance Constrained Programming Problems with Joint Constraints
AbstractIn this paper we consider chance constrained programming problems with joint constraints shown in the literature to be equivalent deterministic nonlinear programming problems. Since most existing computational methods for solution require that the constraints of the equivalent deterministic problem be concave, we obtain a simple condition for which the concavity assumption holds when the right-hand side coefficients are independent random variables. We show that it holds for most probability distributions of practical importance. For the case where the random vector has a multivariate normal distribution, nonexistence of any efficient numerical methods for evaluating multivariate normal integrals necessitates the use of lower bound approximations. We propose an approximation for the case of positively correlated normal random variables.
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): 19 (1973)
Issue (Month): 11 (July)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.