| 1 | -- | 19 | Donald Goldfarb, Michael J. Todd. Modifications and implementation of the ellipsoid algorithm for linear programming |
| 20 | -- | 33 | Dianne P. O'Leary. A discrete Newton algorithm for minimizing a function of many variables |
| 34 | -- | 49 | Michael J. Todd. An implementation of the simplex method for linear programming problems with variable upper bounds |
| 50 | -- | 74 | Gérard Cornuéjols, Jean-Michel Thizy. Some facets of the simple plant location polytope |
| 75 | -- | 86 | Hiroshi Yamashita. A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function |
| 87 | -- | 110 | Dietmar Saupe. On accelerating PL continuation algorithms by predictor - corrector methods |
| 111 | -- | 116 | Mordechai I. Henig. Existence and characterization of efficient decisions with respect to cones |
| 117 | -- | 137 | Victor Griffin, Julián Aráoz, Jack Edmonds. Polyhedral polarity defined by a general bilinear inequality |
| 138 | -- | 147 | B. Curtis Eaves, Robert M. Freund. Optimal scaling of balls and polyhedra |
| 148 | -- | 169 | Thomas R. Elken. Combining a path method and parametric linear programming for the computation of competitive equilibria |
| 170 | -- | 180 | Andrew C. Ho. Worst case analysis of a class of set covering heuristics |
| 181 | -- | 192 | Robert D. Doverspike. Some perturbation results for the Linear Complementarity Problem |
| 193 | -- | 205 | Jean-Pierre Crouzeix, Jacques A. Ferland. Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons |
| 206 | -- | 215 | Katta G. Murty, Yahya Fathi. A critical index algorithm for nearest point problems on simplicial cones |
| 216 | -- | 226 | Manlio Gaudioso, Maria Flavia Monaco. A bundle type approach to the unconstrained minimization of convex nonsmooth functions |
| 227 | -- | 232 | Rainer E. Burkard, Ulrich Fincke. On random quadratic bottleneck assignment problems |
| 237 | -- | 273 | Charles E. Blair, Robert G. Jeroslow. The value function of an integer program |
| 274 | -- | 313 | Robert Fourer. Solving staircase linear programs by the simplex method, 1: Inversion |
| 314 | -- | 325 | Richard J. Herman. Dynamically restricted pricing in the simplex method for linear programming |
| 326 | -- | 340 | Larry Nazareth, Jorge Nocedal. Conjugate direction methods with variable storage |
| 341 | -- | 348 | Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida. Optimal sharing |
| 349 | -- | 352 | Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright. A note on a sufficient-decrease criterion for a non-derivative step-length procedure |
| 353 | -- | 356 | Sunita Agarwal, Prabha Sharma, A. K. Mittal. An extension of the edge covering problem |