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

Published Online:https://doi.org/10.1287/opre.10.4.463

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.