1. Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems

   • U. M. Garcia Palomares
   • O. L. Mangasarian

   OriginalPaper Pages: 1 - 13

2. A cutting plane algorithm for solving bilinear programs

   • Hiroshi Konno

   OriginalPaper Pages: 14 - 27

3. Win probabilities and simple majorities in probabilistic voting situations

   • Peter C. Fishburn
   • William V. Gehrlein

   OriginalPaper Pages: 28 - 41

4. Some convergence properties of the conjugate gradient method

   • M. J. D. Powell

   OriginalPaper Pages: 42 - 49

5. A numerically stable optimization method based on A homogeneous function

   • J. S. Kowalik
   • K. G. Ramakrishnan

   OriginalPaper Pages: 50 - 66

6. Feasible directions algorithms for optimization problems with equality and inequality constraints

   • D. Q. Mayne
   • E. Polak

   OriginalPaper Pages: 67 - 80

7. On A characterization of optimality in convex programming

   • A. Ben-Israel
   • A. Ben-Tal

   OriginalPaper Pages: 81 - 88

8. A condensation method for generalized geometric programming

   • M. J. Rijckaert
   • X. M. Martens

   Short Communication Pages: 89 - 93

9. A note on polyhedral sets having A least element

   • Henry Gabbay

   Short Communication Pages: 94 - 96

10. The assignment polytope

    • Richard A. Brualdi
    • Peter M. Gibson

    Short Communication Pages: 97 - 101

11. Nominations for Treasurer and Council

    • Philip Wolfe

    Notice Pages: 102 - 102

12. The Mathematical Programming Society

    Notice Pages: 103 - 103

13. Editorial policy

    Notice Pages: 104 - 104

14. A network simplex method

    • W. H. Cunningham

    OriginalPaper Pages: 105 - 116

15. Maximization of A convex quadratic function under linear constraints

    • Hiroshi Konno

    OriginalPaper Pages: 117 - 127

16. Finding the nearest point in A polytope

    • Philip Wolfe

    OriginalPaper Pages: 128 - 149

17. Shortest path algorithms for knapsack type problems

    • A. M. Frieze

    OriginalPaper Pages: 150 - 157

18. Further facet generating procedures for vertex packing polytopes

    • Laurence A. Wolsey

    Short Communication Pages: 158 - 163

19. Transversal matroid intersections and related packings

    • David B. Weinberger

    OriginalPaper Pages: 164 - 176

20. A dual decomposition algorithm

    • John A. Lawrence Jr.

    OriginalPaper Pages: 177 - 193

21. Approximate cutting planes in nonlinear programming

    • S. C. Parikh

    OriginalPaper Pages: 194 - 198

22. The 8th IFIP Conference on optimization techniques

    Notice Pages: 199 - 199

23. The Mathematical Programming Society

    Notice Pages: 200 - 200

24. Editorial policy

    Notice Pages: 201 - 201

25. Editor's note

    EditorialNotes Pages: 203 - 203

26. Mathematics in economics: Achievements, difficulties, perspectives

    • Leonid V. Kantorovich

    OriginalPaper Pages: 204 - 211

27. Concepts of optimality and their uses

    • Tjalling C. Koopmans

    OriginalPaper Pages: 212 - 228

28. A dual algorithm for the one-machine scheduling problem

    • Marshall L. Fisher

    OriginalPaper Pages: 229 - 251

29. An existence theorem for solutions tof(x) = 0

    • F. J. Gould
    • J. W. Tolle

    OriginalPaper Pages: 252 - 262

30. Superlinearly convergent variable metric algorithms for general nonlinear programming problems

    • Shih-Ping Han

    OriginalPaper Pages: 263 - 282

31. Fractional programming without differentiability

    • J. M. Borwein

    OriginalPaper Pages: 283 - 290

32. Bottleneck linear programming

    • Robert S. Garfinkel
    • Mendu Rao

    OriginalPaper Pages: 291 - 298

33. Another note on bimatrix games

    • M. Bastian

    Short Communication Pages: 299 - 300

34. The Mathematical Programming Society

    Notice Pages: 301 - 301

35. Symposium announcement

    Notice Pages: 302 - 302