A solution is given to a programming problem under uncertainty when the distribution function of demand is discrete and the cost structure assumes a certain type. The resulting objective function is convex, but not necessarily separable. With a rather simple change in variables, the solution of the stochastic problem is shown to be equivalent to the solution of a linear program.
No takes yet. Share an insight, caveat, or question.
Salah E. Elmaghraby (1959) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: