1. Simplex pivots on the set packing polytope

   • Yoshiro Ikura
   • George L. Nemhauser

   OriginalPaper Pages: 123 - 138

2. On the complexity of four polyhedral set containment problems

   • Robert M. Freund
   • James B. Orlin

   OriginalPaper Pages: 139 - 145

3. On constraint sets of infinite linear programs over ordered fields

   • K. O. Kortanek
   • H. M. Strojwas

   OriginalPaper Pages: 146 - 161

4. Newton's method for constrained optimization

   • Jonathan Goodman

   OriginalPaper Pages: 162 - 171

5. Properties of a representation of a basis for the null space

   • Philip E. Gill
   • Walter Murray
   • Margaret H. Wright

   OriginalPaper Pages: 172 - 186

6. Efficient dual simplex algorithms for the assignment problem

   • D. Goldfarb

   OriginalPaper Pages: 187 - 203

7. A simplex algorithm for piecewise-linear programming I: Derivation and proof

   • Robert Fourer

   OriginalPaper Pages: 204 - 233

8. Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems

   • A. Warburton

   OriginalPaper Pages: 234 - 241