| 241 | -- | 262 | Steve Smale. On the average number of steps of the simplex method of linear programming |
| 263 | -- | 282 | C. B. García, Floyd J. Gould. An application of homotopy to solving linear programs |
| 283 | -- | 290 | James K. Ho, Etienne Loute. Computational experience with advanced implementation of decomposition algorithms for linear programming |
| 291 | -- | 306 | Manfred v. Golitschek, Uriel G. Rothblum, Hans Schneider. A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds |
| 307 | -- | 319 | Marco A. López, Enriqueta Vercher. Optimality conditions for nondifferentiable convex semi-infinite programming |
| 320 | -- | 341 | Krzysztof C. Kiwiel. An aggregate subgradient method for nonsmooth convex minimization |
| 342 | -- | 354 | Jean-Pierre Crouzeix, Jacques A. Ferland, Siegfried Schaible. Duality in generalized linear fractional programming |
| 355 | -- | 361 | Martin E. Dyer, John Walker. A note on bicriterion programming |