Variable metric methods for minimizing a class of nondifferentiable functions S. P. Han OriginalPaper Pages: 1 - 13
A method for globally minimizing concave functions over convex sets Karla Leigh Hoffman OriginalPaper Pages: 22 - 32
A class of simplicial restart fixed point algorithms without an extra dimension G. van der LaanA. J. J. Talman OriginalPaper Pages: 33 - 48
Combined lp and quasi-Newton methods for minimax optimization Jørgen HaldKaj Madsen OriginalPaper Pages: 49 - 62
On optimizing functions which are defined in part by an approximation process D. J. HartfielG. L. Curry OriginalPaper Pages: 63 - 80
A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model Jong-Shi PangPatrick S. C. Lee OriginalPaper Pages: 81 - 102
Elimination of bounds in optimization problems by transforming variables Fern Sassower Sisser OriginalPaper Pages: 110 - 121
Call for papers: International symposium on semi-infinite programming and applications Notice Pages: 122 - 122
Duality gaps in semi-infinite linear programming—an approximation problem Dennis F. Karney OriginalPaper Pages: 129 - 143
A note on quasi-newton formulae for sparse second derivative matrices M. J. D. Powell OriginalPaper Pages: 144 - 151
An equivalence between two algorithms for quadratic programming Jong-Shi Pang OriginalPaper Pages: 152 - 165
Integer programming duality: Price functions and sensitivity analysis Laurence A. Wolsey OriginalPaper Pages: 173 - 195
Superlinear convergence of Broyden's boundedθ-class of methods Andrzej Stachurski OriginalPaper Pages: 196 - 212
Homeomorphisms of triangulations with applications to computing fixed points Daniel Solow OriginalPaper Pages: 213 - 224
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles Wen-lian HsuYoshiro IkuraGeorge L. Nemhauser OriginalPaper Pages: 225 - 232
Connected and alternating vectors: Polyhedra and algorithms Heinz GröflinThomas M. Liebling OriginalPaper Pages: 233 - 244
A set of staircase linear programming test problems James K. HoEtienne Loute Short Communication Pages: 245 - 250
Call for papers: Third Symposium on Mathematical Programming with Data Perturbations Notice Pages: 251 - 252
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations N. ChristofidesA. MingozziP. Toth OriginalPaper Pages: 255 - 282
An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming James K. HoEtienne Loute OriginalPaper Pages: 303 - 326
An example of cycling in a feasible point algorithm M. J. D. Powell Short Communication Pages: 353 - 357
