Technical Note—Minimax Procedure for a Class of Linear Programs under Uncertainty

We consider a linear programming problem with random a ij and b i elements that have known (finite) mean and variance, but whose distribution functions are otherwise unspecified. A minimax solution of the stochastic programming model is obtained by solving an equivalent deterministic convex programming problem. We derive these deterministic equivalents under different assumptions regarding the stochastic nature of the random parameters.