1. Two commodity network flows and linear programming

   • M. Sakarovitch

   OriginalPaper Pages: 1 - 20

2. Hybrid computation in mathematical programming

   • L. Dekker

   OriginalPaper Pages: 21 - 43

3. A superlinearly convergent method for minimization problems with linear inequality constraints

   • Klaus Ritter

   OriginalPaper Pages: 44 - 71

4. Exact penalty functions in nonlinear programming

   • J. P. Evans
   • F. J. Gould
   • J. W. Tolle

   OriginalPaper Pages: 72 - 97

5. A note on Fermat's problem

   • Harold W. Kuhn

   OriginalPaper Pages: 98 - 107

6. Two-commodity cut-packing problem

   • T. C. Hu

   Short Communication Pages: 108 - 109

7. On a characterization of P-matrices

   • Arie Tamir

   Short Communication Pages: 110 - 112

8. Book reviews

   • George L. Nemhauser
   • A. C. Williams
   • Joseph T. Howson Jr.

   BookReview Pages: 113 - 118

9. Books received

   Legacy Pages: 118 - 119

10. Elections to National Academy of Sciences (U.S.A.)

    Notice Pages: 120 - 122

11. Editorial policy

    Notice Pages: 123 - 123

12. The Mathematical Programming Society

    Notice Pages: 124 - 124

13. Convex analysis treated by linear programming

    • R. J. Duffin

    OriginalPaper Pages: 125 - 143

14. A computational comparison of some non-linear programs

    • J. Asaadi

    OriginalPaper Pages: 144 - 154

15. Investigation of some branch and bound strategies for the solution of mixed integer linear programs

    • G. Mitra

    OriginalPaper Pages: 155 - 170

16. Computational experience with a group theoretic integer programming algorithm

    • G. Anthony Gorry
    • William D. Northup
    • Jeremy F. Shapiro

    OriginalPaper Pages: 171 - 192

17. On search directions for minimization algorithms

    • M. J. D. Powell

    OriginalPaper Pages: 193 - 201

18. Contributions to the theory of stochastic programming

    • András Prékopa

    OriginalPaper Pages: 202 - 221

19. Generalized dynamic programming methods in integer programming

    • Laurence A. Wolsey

    OriginalPaper Pages: 222 - 232

20. On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm

    • Vijaykumar Aggarwal

    Short Communication Pages: 233 - 234

21. Book reviews

    • Stanley Zionts

    BookReview Pages: 235 - 240

22. Books received

    Legacy Pages: 240 - 240

23. Seminar on Generalized Inverses and Applications

    Notice Pages: 241 - 241

24. Editorial Policy

    Notice Pages: 242 - 242

25. The Mathematical Programming Society

    Notice Pages: 243 - 243

26. Projection methods for non-linear programming

    • R. W. H. Sargent
    • B. A. Murtagh

    OriginalPaper Pages: 245 - 268

27. On the equivalence of some generalized network problems to pure network problems

    • Fred Glover
    • D. Klingman

    OriginalPaper Pages: 269 - 278

28. An efficient one—dimensional search procedure for barrier functions

    • L. S. Lasdon
    • R. L. Fox
    • M. W. Ratner

    OriginalPaper Pages: 279 - 296

29. Inverse programming: Theory and examples

    • R. G. Cassidy
    • C. A. Field
    • W. R. S. Sutherland

    OriginalPaper Pages: 297 - 308

30. Practical convergence conditions for unconstrained optimization

    • Melanie L. Lenard

    OriginalPaper Pages: 309 - 323

31. Generic properties of the complementarity problem

    • Romesh Saigal
    • Carl Simon

    OriginalPaper Pages: 324 - 335

32. The graph of an abstract polytope

    • Katta G. Murty

    OriginalPaper Pages: 336 - 346

33. A new solvable case of the traveling salesman problem

    • Maciej M. Sysło

    Short Communication Pages: 347 - 348

34. Book reviews

    • Jorge Moré
    • Richard W. Cottle
    • Mark J. Eisner

    BookReview Pages: 349 - 353

35. Editorial policy

    Notice Pages: 354 - 354

36. The mathematical programming society

    Notice Pages: 355 - 355