Articles

1. On using equality-constraint algorithms for inequality constrained problems

   • J. P. Evans
   • F. J. Gould

   OriginalPaper Pages: 324 - 329

2. r-convex functions

   • Mordecai Avriel

   OriginalPaper Pages: 309 - 323

3. A fundamental problem in linear inequalities with applications to the travelling salesman problem

   • Katta G. Murty

   OriginalPaper Pages: 296 - 308

4. Extremization of functions with equality constraints

   • H. Kwakernaak
   • R. C. W. Strijbos

   OriginalPaper Pages: 279 - 295

5. Updated triangular factors of the basis to maintain sparsity in the product form simplex method

   • J. J. H. Forrest
   • J. A. Tomlin

   OriginalPaper Pages: 263 - 278

6. Editorial policy

   EditorialNotes Pages: 262 - 262

7. The mathematical programming society

   Notice Pages: 261 - 261

8. Explicit solution of an optimization problem

   • Philip Wolfe

   Note Pages: 258 - 260

9. On the rate of convergence of certain methods of centers

   • O. Pironneau
   • E. Polak

   OriginalPaper Pages: 230 - 257

10. Algorithms for the vector maximization problem

    • Johan Philip

    OriginalPaper Pages: 207 - 229

11. A language for nonlinear programming problems

    • Robert E. Pugh

    OriginalPaper Pages: 176 - 206

12. Characterization theorems for stochastic programs

    • Roger Wets

    OriginalPaper Pages: 166 - 175

13. An algorithm for solving linearly constrained optimization problems

    • R. Fletcher

    OriginalPaper Pages: 133 - 165

14. Publications

    • T. Magnanti

    OriginalPaper Pages: 130 - 132

15. The complementarity problem

    • S. Karamardian

    OriginalPaper Pages: 107 - 129

16. An efficient algorithm for minimizing barrier and penalty functions

    • Leon S. Lasdon

    OriginalPaper Pages: 65 - 106

17. Enumerative inequalities in integer programming

    • Claude-Alain Burdet

    OriginalPaper Pages: 32 - 64

18. Balanced matrices

    • C. Berge

    OriginalPaper Pages: 19 - 31

19. Geometry of optimality conditions and constraint qualifications

    • F. J. Gould
    • Jon W. Tolle

    OriginalPaper Pages: 1 - 18

20. Editorial policy

    EditorialNotes Pages: 377 - 377

21. Referees 1971

    Notices Pages: 376 - 376

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

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

    OriginalPaper Pages: 366 - 375

23. Optimality conditions for quadratic programming

    • Antal Majthay

    OriginalPaper Pages: 359 - 365

24. A projective method for structured nonlinear programs

    • Michael D. Grigoriadis

    OriginalPaper Pages: 321 - 358

25. Applications of symmetric derivatives in mathematical programming

    • Roland A. Minch

    OriginalPaper Pages: 307 - 320

26. Discrete optimization on a multivariable boolean lattice

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

    OriginalPaper Pages: 301 - 306

27. Linear inequalities, mathematical programming and matrix theory

    • Abraham Berman
    • Adi Ben-Israel

    OriginalPaper Pages: 291 - 300

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

    • Jean-Marie Pla

    OriginalPaper Pages: 275 - 290

29. Editorial policy

    EditorialNotes Pages: 274 - 274

30. Notice

    • A. C. Williams

    OriginalPaper Pages: 270 - 273

31. A solvable case of the traveling salesman problem

    • Eugene L. Lawler

    Note Pages: 267 - 269

32. Problems and methods with multiple objective functions

    • B. Roy

    OriginalPaper Pages: 239 - 266

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

    • Garth P. McCormick

    OriginalPaper Pages: 217 - 238

34. Reinversion with the preassigned pivot procedure

    • Eli Hellerman
    • Dennis Rarick

    OriginalPaper Pages: 195 - 216

35. Blocking and anti-blocking pairs of polyhedra

    • D. R. Fulkerson

    OriginalPaper Pages: 168 - 194

36. Hybrid programs: Linear and least-distance

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

    OriginalPaper Pages: 153 - 167

37. On the solution of linear equation/inequality systems

    • A. Orden

    OriginalPaper Pages: 137 - 152

38. Matroids and the greedy algorithm

    • Jack Edmonds

    OriginalPaper Pages: 127 - 136

39. Editorial policy

    EditorialNotes Pages: 126 - 126

40. The Mathematical Programming Society

    OriginalPaper Pages: 123 - 125

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

    Notices Pages: 121 - 122

42. Publications

    • Harold W. Kuhn

    OriginalPaper Pages: 117 - 120

43. An example of an ill-conditioned nlp problem

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

    Note Pages: 113 - 116

44. Some problems in discrete optimization

    • T. C. Hu

    OriginalPaper Pages: 102 - 112

45. On pseudo-convex functions of nonnegative variables

    • Richard W. Cottle
    • Jacques A. Ferland

    OriginalPaper Pages: 95 - 101

46. Experiments in mixed-integer linear programming

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

    OriginalPaper Pages: 76 - 94

47. On the basic theorem of complementarity

    • B. C. Eaves

    OriginalPaper Pages: 68 - 75

48. Some recent results inn-person game theory

    • Louis J. Billera

    OriginalPaper Pages: 58 - 67

49. Recent advances in unconstrained optimization

    • M. J. D. Powell

    OriginalPaper Pages: 26 - 57

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

    • Michael Held
    • Richard M. Karp

    OriginalPaper Pages: 6 - 25