Computational Mathematical Programming

An implicit enumeration procedure for the general linear complementarity problem....Pages 1-20
Recursive quadratic programming methods based on the augmented lagrangian....Pages 21-41
A primal truncated newton algorithm with application to large-scale nonlinear network optimization....Pages 43-71
Approximating some convex programs in terms of borel fields....Pages 73-78
Computer-assisted analysis for diagnosing infeasible or unbounded linear programs....Pages 79-97
Restricted simplicial decomposition: Computation and extensions....Pages 99-118
Recent advances in the decomposition approach to linear programming....Pages 119-128
A note on solution of nonlinear programming problems with imprecise function and gradient values....Pages 129-138
A new algorithm for highly curved constrained optimisation....Pages 139-154
An implementation of an algorithm for univariate minimization and an application to nested optimization....Pages 155-166
On practical stopping rules for the simplex method....Pages 167-174
An experimental approach to karmarkar’s projective method for linear programming....Pages 175-191