1. Pivot selection methods of the Devex LP code

   • Paula M. J. Harris

   OriginalPaper Pages: 1 - 28

2. Edmonds polytopes and weakly hamiltonian graphs

   • Václav Chvátal

   OriginalPaper Pages: 29 - 40

3. Stability of the solution of definite quadratic programs

   • James W. Daniel

   OriginalPaper Pages: 41 - 53

4. A revised simplex method for linear multiple objective programs

   • J. P. Evans
   • R. E. Steuer

   OriginalPaper Pages: 54 - 72

5. On L₁ and Chebyshev estimation

   • Gautam Appa
   • Cyril Smith

   OriginalPaper Pages: 73 - 87

6. Matching, Euler tours and the Chinese postman

   • Jack Edmonds
   • Ellis L. Johnson

   OriginalPaper Pages: 88 - 124

7. Election of Council

   Notice Pages: 125 - 125

8. Editorial policy

   Notice Pages: 126 - 126

9. The Mathematical Programming Society

   Notice Pages: 127 - 127

10. An exact penalty function for nonlinear programming with inequalities

    • R. Fletcher

    OriginalPaper Pages: 129 - 150

11. Applications of a general convergence theory for outer approximation algorithms

    • William W. Hogan

    OriginalPaper Pages: 151 - 168

12. A linear max—min problem

    • James E. Falk

    OriginalPaper Pages: 169 - 188

13. Unconstrained optimization based on homogeneous models

    • Christakis Charalambous

    OriginalPaper Pages: 189 - 198

14. On the facial structure of set packing polyhedra

    • Manfred W. Padberg

    OriginalPaper Pages: 199 - 215

15. More pathological examples for network flow problems

    • Norman Zadeh

    OriginalPaper Pages: 217 - 224

16. A general saddle point result for constrained optimization

    • K. J. Arrow
    • F. J. Gould
    • S. M. Howe

    OriginalPaper Pages: 225 - 234

17. Computable error bounds for nonlinear programming

    • Stephen M. Robinson

    OriginalPaper Pages: 235 - 242

18. Quasi-concavity and pseudo-concavity of cubic functions

    • Siegfried Schaible

    Short Communication Pages: 243 - 247

19. Book review

    • W. F. Lucas

    BookReview Pages: 248 - 249

20. Books received

    BookReview Pages: 249 - 249

21. Nomination of Chairman-Elect

    Notice Pages: 250 - 250

22. Editorial policy

    Notice Pages: 251 - 251

23. The Mathematical Programming Society

    Notice Pages: 252 - 252

24. Announcement

    • M. L. Balinski

    Announcement Pages: 253 - 254

25. A bad network problem for the simplex method and other minimum cost flow algorithms

    • Norman Zadeh

    OriginalPaper Pages: 255 - 266

26. Extension of optimality conditions via supporting functions

    • M. S. Bazaraa
    • J. J. Goode

    OriginalPaper Pages: 267 - 285

27. A column generation algorithm for nonlinear programming

    • Fredric H. Murphy

    OriginalPaper Pages: 286 - 298

28. Some classes of matrices in linear complementarity theory

    • C. B. Garcia

    OriginalPaper Pages: 299 - 310

29. The general quadratic optimization problem

    • Edward L. Keller

    OriginalPaper Pages: 311 - 337

30. A greedy algorithm for solving a certain class of linear programmes

    • F. D. J. Dunstan
    • D. J. A. Welsh

    OriginalPaper Pages: 338 - 353

    

31. A dual approach to solving nonlinear programming problems by unconstrained optimization

    • R. Tyrrell Rockafellar

    OriginalPaper Pages: 354 - 373

32. The associated maximization problem for separable games

    • L. C. Westphal
    • A. R. Stubberud

    OriginalPaper Pages: 374 - 380

33. Book reviews

    BookReview Pages: 381 - 384

34. Books received

    BookReview Pages: 385 - 385

35. Editorial policy

    Notice Pages: 386 - 386

36. Referees 1973

    Notice Pages: 387 - 387

37. The Mathematical Programming Society

    Notice Pages: 388 - 388