New Methods in Mathematical Programming—Methods of Solution of Linear Programs Under Uncertainty

Abstract

The three most usual methods of reducing the effects of uncertainty in the technology matrix, requirement vector, or cost vector of a linear programming problem are the expected-value solution, the “fat” solution, and the “slack” solution. These methods are explained in some detail, and the relation between these various methods is pointed out.

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 — 45 citations exist upstream.