1. The journal

   • M. L. Balinski
   • Philip Wolfe

   OriginalPaper Pages: 1 - 5

2. The traveling-salesman problem and minimum spanning trees: Part II

   • Michael Held
   • Richard M. Karp

   OriginalPaper Pages: 6 - 25

3. Recent advances in unconstrained optimization

   • M. J. D. Powell

   OriginalPaper Pages: 26 - 57

4. Some recent results inn-person game theory

   • Louis J. Billera

   OriginalPaper Pages: 58 - 67

5. On the basic theorem of complementarity

   • B. C. Eaves

   OriginalPaper Pages: 68 - 75

6. Experiments in mixed-integer linear programming

   • M. Benichou
   • J. M. Gauthier
   • O. Vincent

   OriginalPaper Pages: 76 - 94

7. On pseudo-convex functions of nonnegative variables

   • Richard W. Cottle
   • Jacques A. Ferland

   OriginalPaper Pages: 95 - 101

8. Some problems in discrete optimization

   • T. C. Hu

   OriginalPaper Pages: 102 - 112

9. An example of an ill-conditioned nlp problem

   • T. B. Crabill
   • J. P. Evans
   • F. J. Gould

   Note Pages: 113 - 116

10. Publications

    • Harold W. Kuhn

    OriginalPaper Pages: 117 - 120

11. Election of G. B. Dantzig to the national academy of sciences (U.S.A.)

    Notices Pages: 121 - 122

12. The Mathematical Programming Society

    OriginalPaper Pages: 123 - 125

13. Editorial policy

    EditorialNotes Pages: 126 - 126

14. Matroids and the greedy algorithm

    • Jack Edmonds

    OriginalPaper Pages: 127 - 136

15. On the solution of linear equation/inequality systems

    • A. Orden

    OriginalPaper Pages: 137 - 152

16. Hybrid programs: Linear and least-distance

    • T. D. Parsons
    • A. W. Tucker

    OriginalPaper Pages: 153 - 167

17. Blocking and anti-blocking pairs of polyhedra

    • D. R. Fulkerson

    OriginalPaper Pages: 168 - 194

18. Reinversion with the preassigned pivot procedure

    • Eli Hellerman
    • Dennis Rarick

    OriginalPaper Pages: 195 - 216

19. Penalty function versus non-penalty function methods for constrained nonlinear programming problems

    • Garth P. McCormick

    OriginalPaper Pages: 217 - 238

20. Problems and methods with multiple objective functions

    • B. Roy

    OriginalPaper Pages: 239 - 266

21. A solvable case of the traveling salesman problem

    • Eugene L. Lawler

    Note Pages: 267 - 269

22. Notice

    • A. C. Williams

    OriginalPaper Pages: 270 - 273

23. Editorial policy

    EditorialNotes Pages: 274 - 274

24. An “out-of-kilter” algorithm for solving minimum cost potential problems

    • Jean-Marie Pla

    OriginalPaper Pages: 275 - 290

25. Linear inequalities, mathematical programming and matrix theory

    • Abraham Berman
    • Adi Ben-Israel

    OriginalPaper Pages: 291 - 300

26. Discrete optimization on a multivariable boolean lattice

    • D. J. Wilde
    • J. M. Sanchez-Anton

    OriginalPaper Pages: 301 - 306

27. Applications of symmetric derivatives in mathematical programming

    • Roland A. Minch

    OriginalPaper Pages: 307 - 320

28. A projective method for structured nonlinear programs

    • Michael D. Grigoriadis

    OriginalPaper Pages: 321 - 358

29. Optimality conditions for quadratic programming

    • Antal Majthay

    OriginalPaper Pages: 359 - 365

30. Linear programming with multiple objective functions: Step method (stem)

    • R. Benayoun
    • J. de Montgolfier
    • O. Laritchev

    OriginalPaper Pages: 366 - 375

31. Referees 1971

    Notices Pages: 376 - 376

32. Editorial policy

    EditorialNotes Pages: 377 - 377