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

A. Madansky
Additional contact information
A. Madansky: The Rand Corporation, Santa Monica, California

Operations Research, 1962, vol. 10, issue 4, 463-471

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.

Date: 1962
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.4.463 (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:oropre:v:10:y:1962:i:4:p:463-471

Access Statistics for this article

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