Infinite Programming Proceedings of an International Symposium on Infinite Dimensional Linear Programming Churchill College, Cambridge, United Kingdom, September 7–10, 1984

Openness, closedness and duality in Banach spaces with applications to continuous linear programming.- Conditions for the closedness of the characteristic cone associated with an infinite linear system.- Symmetric duality: a prelude.- Algebraic fundamentals of linear programming.- On regular semi-infinite optimization.- Semi-infinite programming and continuum physics.- On the computation of membrane-eigenvalues by semi-infinite programming methods.- Lagrangian methods for semi-infinite programming problems.- A new primal algorithm for semi-infinite linear programming.- Extreme points and purification algorithms in general linear programming.- Network programming in continuous time with node storage.- The theorem of Gale for infinite networks and applications.- Nonlinear optimal control problems as infinite-dimensional linear programming problems.- Continuity and asymptotic behaviour of the marginal function in optimal control.- Alternative theorems for general complementarity problems.- Nonsmooth analysis and optimization for a class of nonconvex mappings.- Minimum norm problems in normed vector lattices.- Stochastic nonsmooth analysis and optimization in Banach spaces.- Titles and authors of other papers presented at the symposium.