Chance Constraints and Normal Deviates

Abstract

Linear programming as a problem in optimizing a linear functional subject to linear inequality constraints is first discussed along with possible uses of the resulting duality relations. Various approaches to dealing with such problems when parts of the data are subject to error are briefly reviewed. Chance constrained programming refers to the class of such cases in which contraint violations are admissible up to pre- assigned probability levels. This topic is elaborated in the context of a ship-chartering problem in which independent normally distributed deviates from the (known) average demands may occur in any of the periods to be considered. Certain additional assumptions (including the use of a specified class of linear decision rules) make it possible to effect reductions first to a nonlinear (mathematical) programming and then to a linear programming problem. The use of the resulting duality relations for evaluating risk and quality levels of planned performance are then briefly examined.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 207 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.