1. Large-scale linear programming: Geometry, working bases and factorizations

   • Michael J. Todd

   OriginalPaper Pages: 1 - 20

2. Computational aspects of two-segment separable programming

   • R. R. Meyer

   OriginalPaper Pages: 21 - 39

3. An iterative scheme for variational inequalities

   • Stella Dafermos

   OriginalPaper Pages: 40 - 47

4. An ideal column algorithm for integer programs with special ordered sets of variables

   • R. Kipp Martin
   • Dennis J. Sweeney

   OriginalPaper Pages: 48 - 63

5. Complexity of some parametric integer and network programming problems

   • Patricia J. Carstensen

   OriginalPaper Pages: 64 - 75

6. The continuous collapsing Knapsack problem

   • Marc E. Posner

   OriginalPaper Pages: 76 - 86

7. On characterizingL ₁-supports, natural and Chebyshev approximates

   • Stephen J. Grotzinger

   OriginalPaper Pages: 87 - 99

8. Error bounds for the aggregated convex programming problem

   • Gur Huberman

   OriginalPaper Pages: 100 - 108

9. The sphere method and the robustness of the ellipsoid algorithm

   • S. Halfin

   OriginalPaper Pages: 109 - 116

10. References 1982

    Notice Pages: 117 - 119

11. TIMS XXVI

    Notice Pages: 120 - 120

12. Call for papers: Ninth Symposium on Numerical Mathematics

    Notice Pages: 121 - 121

13. CRAI Workshop on Algorithms and Software for Nonlinear Optimization

    Notice Pages: 122 - 122