1. Maximal flow through a domain

   • Gilbert Strang

   OriginalPaper Pages: 123 - 143

2. Revisions of constraint approximations in the successive QP method for nonlinear programming problems

   • Kaoru Tone

   OriginalPaper Pages: 144 - 152

3. Optimal approximation of sparse hessians and its equivalence to a graph coloring problem

   • S. Thomas McCormick

   OriginalPaper Pages: 153 - 171

4. Randomly generated polytopes for testing mathematical programming algorithms

   • W. B. van Dam
   • J. B. G. Frenk
   • J. Telgen

   OriginalPaper Pages: 172 - 181

5. On cycling in the network simplex method

   • William H. Cunningham
   • John G. Klincewicz

   OriginalPaper Pages: 182 - 189

6. Truncated-Newton algorithms for large-scale unconstrained optimization

   • Ron S. Dembo
   • Trond Steihaug

   OriginalPaper 01 June 1983 Pages: 190 - 212

7. Penalty functions in ε-programming and ε-minimax problems

   • P. Loridan
   • J. Morgan

   OriginalPaper Pages: 213 - 231

8. Some properties of nondifferentiable pseudoconvex functions

   • Sándor Komlósi

   OriginalPaper Pages: 232 - 237

9. An improved disaggregation method for transportation problems

   • P. Zipkin
   • K. Raimer

   Short Communication Pages: 238 - 242

10. Announcement

    Notice Pages: 243 - 243