Computational Mathematical Programming

An Implicit Enumeration Procedure For The General Linear Complementarity Problem -- Recursive Quadratic Programming Methods Based On The Augmented Lagrangian -- A Primal Truncated Newton Algorithm With Application To Large-scale Nonlinear Network Optimization -- Approximating Some Convex Programs In Terms Of Borel Fields -- Computer-assisted Analysis For Diagnosing Infeasible Or Unbounded Linear Programs -- Restricted Simplicial Decomposition: Computation And Extensions -- Recent Advances In The Decomposition Approach To Linear Programming -- A Note On Solution Of Nonlinear Programming Problems With Imprecise Function And Gradient Values -- A New Algorithm For Highly Curved Constrained Optimisation -- An Implementation Of An Algorithm For Univariate Minimization And An Application To Nested Optimization -- On Practical Stopping Rules For The Simplex Method -- An Experimental Approach To Karmarkar’s Projective Method For Linear Programming. Edited By K. L. Hoffman, R. H. F. Jackson, J. Telgen.