×

Critical path analyses via chance constrained and stochastic programming. (English) Zbl 0125.09602

Authors’ summary: Chance-constrained programming methods are applied to examine some statistical properties of PERT networks. Using duality, the PERT method is shown to be equivalent to use of the crudest linear decision rule and the confidence (or lack thereof) in meeting constraints is explicitly presented. The distribution of completion times (= Tintner’s stochastic programming) follows easily and may often be multimodal, contrasting with (erroneous) central limit theorem usage in the literature. Possible extensions and developments of PERT using more adequate chance-constrained models and techniques are suggested and will be presented elsewhere.

MSC:

90C15 Stochastic programming
PDFBibTeX XMLCite
Full Text: DOI