Modifications and implementation of the ellipsoid algorithm for linear programming Donald GoldfarbMichael J. Todd OriginalPaper Pages: 1 - 19
A discrete Newton algorithm for minimizing a function of many variables Dianne P. O'Leary OriginalPaper Pages: 20 - 33
An implementation of the simplex method for linear programming problems with variable upper bounds Michael J. Todd OriginalPaper Pages: 34 - 49
Some facets of the simple plant location polytope G. CornuejolsJ. -M. Thizy OriginalPaper Pages: 50 - 74
A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function Hiroshi Yamashita OriginalPaper Pages: 75 - 86
On accelerating PL continuation algorithms by predictor—corrector methods Dietmar Saupe OriginalPaper Pages: 87 - 110
Existence and characterization of efficient decisions with respect to cones Mordechai I. Henig OriginalPaper Pages: 111 - 116
Polyhedral polarity defined by a general bilinear inequality Victor GriffinJulián AráozJack Edmonds OriginalPaper Pages: 117 - 137
Combining a path method and parametric linear programming for the computation of competitive equilibria Thomas R. Elken OriginalPaper Pages: 148 - 169
Worst case analysis of a class of set covering heuristics Andrew C. Ho OriginalPaper Pages: 170 - 180
Some perturbation results for the Linear Complementarity Problem Robert D. Doverspike OriginalPaper Pages: 181 - 192
Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons Jean-Pierre CrouzeixJacques A. Ferland OriginalPaper Pages: 193 - 205
A critical index algorithm for nearest point problems on simplicial cones Katta G. MurtyYahya Fathi OriginalPaper Pages: 206 - 215
A bundle type approach to the unconstrained minimization of convex nonsmooth functions Manlio GaudiosoMaria Flavia Monaco OriginalPaper Pages: 216 - 226
On random quadratic bottleneck assignment problems R. E. BurkardU. Fincke OriginalPaper Pages: 227 - 232
Solving staircase linear programs by the simplex method, 1: Inversion Robert Fourer OriginalPaper Pages: 274 - 313
Dynamically restricted pricing in the simplex method for linear programming Richard J. Herman OriginalPaper Pages: 314 - 325
Conjugate direction methods with variable storage Larry NazarethJorge Nocedal OriginalPaper Pages: 326 - 340
A note on a sufficient-decrease criterion for a non-derivative step-length procedure Philip E. GillWalter MurrayMargaret H. Wright Short Communication Pages: 349 - 352
An extension of the edge covering problem S. AgarwalP. SharmaA. K. Mittal Short Communication Pages: 353 - 356
