1. On the average number of steps of the simplex method of linear programming

   • Steve Smale

   OriginalPaper Pages: 241 - 262

2. An application of homotopy to solving linear programs

   • C. B. Garcia
   • F. J. Gould

   OriginalPaper Pages: 263 - 282

3. Computational experience with advanced implementation of decomposition algorithms for linear programming

   • J. K. Ho
   • E. Loute

   OriginalPaper Pages: 283 - 290

4. A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds

   • Manfred v. Golitschek
   • Uriel G. Rothblum
   • Hans Schneider

   OriginalPaper Pages: 291 - 306

5. Optimality conditions for nondifferentiable convex semi-infinite programming

   • M. A. López
   • E. Vercher

   OriginalPaper Pages: 307 - 319

6. An aggregate subgradient method for nonsmooth convex minimization

   • Krzysztof Czesław Kiwiel

   OriginalPaper Pages: 320 - 341

7. Duality in generalized linear fractional programming

   • Jean-Pierre Crouzeix
   • Jacques A. Ferland
   • Siegfried Schaible

   OriginalPaper Pages: 342 - 354

8. A note on bicriterion programming

   • M. E. Dyer
   • J. Walker

   OriginalPaper Pages: 355 - 361