This paper gives an algorithm for L-shaped linear programs which arise naturally in optimal control problems with state constraints and stochastic linear programs (which can be represented in this… Expand

This paper gives an algorithm for L-shaped linear programs which arise naturally in optimal control problems with state constraints and stochastic linear programs (which can be represented in this… Expand

A variant of the revised simplex method is given for solving linear programs with M+L equations, L of which have the property that each variable has at most one nonzero coefficient in them.Expand

An undirected connected graph having failure probabilities associated with each edge is a classic model for network reliability studies. The network reliability is defined as the probability that the… Expand

Abstract : The paper gives necessary and sufficient conditions for optimality for convex programs in abstract spaces. The results obtained here contain as special cases all known duality theorems for… Expand