| 1 | -- | 6 | W. R. S. Sutherland. Optimality in transient markov chains and linear programming |
| 7 | -- | 15 | Johannes Bisschop, Alexander Meeraus. Matrix augmentation and structure preservation in linearly constrained control problems |
| 16 | -- | 30 | Richard S. Sacher. A decomposition algorithm for quadratic programming |
| 31 | -- | 40 | Donald Goldfarb. Curvilinear path steplength algorithms for minimization which use directions of negative curvature |
| 41 | -- | 48 | Quirino Paris. Consistent aggregation of linear complementarity problems |
| 49 | -- | 61 | Richard D. McBride. A bump triangular dynamic factorization algorithm for the simplex method |
| 62 | -- | 67 | Stanley J. Garstka. An economic interpretation of stochastic programs |
| 68 | -- | 83 | Dennis L. Bricker. Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual |
| 84 | -- | 88 | Imre Bárány. Borsuk's theorem through complementary pivoting |
| 89 | -- | 93 | Mokhtar S. Bazaraa, C. M. Shetty, Jamie J. Goode. On the convergence of a class of algorithms using linearly independent search directions |
| 94 | -- | 99 | Manfred Padberg. k)-configurations and facets for packing problems |
| 100 | -- | 106 | Van Hien Nguyen, Jean-Jacques Strodiot, Robert Mifflin. On conditions to have bounded multipliers in locally lipschitz programming |
| 111 | -- | 126 | Michael J. Todd. A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization |
| 127 | -- | 137 | Yow-Yieh Chang, Richard W. Cottle. Least-index resolution of degeneracy in quadratic programming |
| 138 | -- | 145 | Davis Avis. A note on some computationally difficult set covering problems |
| 146 | -- | 154 | Jan Eriksson. A note on solution of large sparse maximum entropy problems with linear equality constraints |
| 155 | -- | 168 | Hiroshi Yamashita. A differential equation approach to nonlinear programming |
| 169 | -- | 185 | Daniel Solow. Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems |
| 186 | -- | 196 | Ulrich Eckhardt. Weber's problem and weiszfeld's algorithm in general spaces |
| 197 | -- | 214 | Krisorn Jittorntrum. Accelerated convergence for the Powell/Hestenes multiplier method |
| 215 | -- | 227 | André F. Perold. A generalization of the Frank - Wolfe theorem |
| 233 | -- | 247 | Michael J. Todd. Exploiting structure in piecewise-linear homotopy algorithms for solving equations |
| 248 | -- | 273 | Ury Passy, Shaul Yutav. Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints |
| 274 | -- | 285 | Gerard van der Laan, A. J. J. Talman. An improvement of fixed point algorithms by using a good triangulation |
| 286 | -- | 290 | Daniel W. Litwhiler Jr., Adel A. Aly. Steiner's problem and fagnano's result on the sphere |
| 291 | -- | 307 | Roger Fletcher, G. Alistair Watson. First and second order conditions for a class of nondifferentiable optimization problems |
| 308 | -- | 329 | T. H. Mattheiss, Brian K. Schmidt. Computational results on an algorithm for finding all vertices of a polytope |
| 330 | -- | 337 | Jonathan M. Borwein. A note on perfect duality and limiting lagrangeans |
| 338 | -- | 343 | Richard V. Helgason, Jeffery L. Kennington, H. S. Lall. A polynomially bounded algorithm for a singly constrained quadratic program |
| 344 | -- | 348 | Moshe Kress, Arie Tamir. The use of jacobi's lemma in unimodularity theory |
| 349 | -- | 352 | Jean-Pierre Crouzeix. On second order conditions for quasiconvexity |