1. Sensitivity theorems in integer linear programming

   • W. Cook
   • A. M. H. Gerards
   • É. Tardos

   OriginalPaper Pages: 251 - 264

2. Linear complementarity problems with an invariant number of solutions

   • Richard E. Stone

   OriginalPaper Pages: 265 - 291

3. Affirmative action algorithms

   • Yahya Fathi
   • Craig Tovey

   OriginalPaper Pages: 292 - 301

4. The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation

   • Jacqueline Boucher
   • Yves Smeers

   OriginalPaper Pages: 302 - 332

5. Critical sets in parametric optimization

   • H. Th. Jongen
   • P. Jonker
   • F. Twilt

   OriginalPaper Pages: 333 - 353

6. An implementation of a discretization method for semi-infinite programming

   • R. Hettich

   OriginalPaper Pages: 354 - 361

7. On the continuity of a Lagrangian multiplier function in input optimization

   • J. Semple
   • S. Zlobec

   OriginalPaper Pages: 362 - 369

8. Call for nominations: The 1985 Lanchester Prize

   Notice Pages: 370 - 371

9. Efficient dual simplex algorithms for the assignment problem

   • D. Goldfarb

   Erratum Pages: 372 - 372

10. Notice

    Announcement Pages: 373 - 373