Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables

Fredrick S. Hillier
Additional contact information
Fredrick S. Hillier: Stanford University

Management Science, 1967, vol. 14, issue 1, 34-57

Abstract: This paper considers the chance-constrained programming problem where the decision variables can be either bounded and continuous or restricted to be either zero or one, and where some or all of the parameters are random variables that may be statistically dependent. Both exact and approximate solution procedures are presented, where most of these are based on several linear inequalities that permit this problem to be approximated by a number of ordinary (integer or noninteger) linear programming problems. Either zero-order or linear decision rules are allowed for the continuous variables, and a general method of making "second-stage decisions" with either continuous or 0-1 variables is developed.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.14.1.34 (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:14:y:1967:i:1:p:34-57

Access Statistics for this article

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