1. Triangulations (tilings) and certain block triangular matrices

   • G. B. Dantzig
   • A. J. Hoffman
   • T. C. Hu

   OriginalPaper Pages: 1 - 14

2. Convergence properties of relaxation algorithms

   • Gerard G. L. Meyer

   OriginalPaper Pages: 15 - 24

3. Aggregation bounds in stochastic linear programming

   • John R. Birge

   OriginalPaper Pages: 25 - 41

4. On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs

   • S. Sen
   • Hanif D. Sherali

   OriginalPaper Pages: 42 - 56

5. Computing nonlinear network equilibria

   • Philip C. Jones
   • Romesh Saigal
   • Michael Schneider

   OriginalPaper Pages: 57 - 66

6. A decomposition algorithm for linear relaxation of the weightedr-covering problem

   • S. Agarwal
   • A. K. Mittal
   • P. Sharma

   OriginalPaper Pages: 67 - 77

7. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality

   • Bezalel Gavish
   • Hasan Pirkul

   OriginalPaper Pages: 78 - 105

8. Proper, reflecting and absorbing facts of complementary cones

   • Romesh Saigal
   • Richard E. Stone

   OriginalPaper Pages: 106 - 117

9. Mathematical programming study 21

   • Anthony V. Fiacco

   Notice Pages: 118 - 121