Clark's theorem for semi-infinite convex programs

AbstractIn 1961, Clark proved that if either the feasible region of a linear program or its dual is nonempty and bounded, then the other is unbounded. Recently, Duffin has extended this result to a convex program and its Lagrangian dual. Moreover, Duffin showed that under this boundedness assumption there is no duality gap. The purpose of this paper is to extend Duffin's results to semi-infinite programs