1. A competitive (dual) simplex method for the assignment problem

   • M. L. Balinski

   OriginalPaper Pages: 125 - 141

2. Network design problem with congestion effects: A case of bilevel programming

   • P. Marcotte

   OriginalPaper Pages: 142 - 162

3. Global minimization of large-scale constrained concave quadratic problems by separable programming

   • J. B. Rosen
   • P. M. Pardalos

   OriginalPaper Pages: 163 - 174

4. A method of linearizations for linearly constrained nonconvex nonsmooth minimization

   • Krzysztof C. Kiwiel

   OriginalPaper Pages: 175 - 187

5. An algorithm for finding the global maximum of a multimodal, multivariate function

   • Regina Hunter Mladineo

   OriginalPaper Pages: 188 - 200

6. On the stability of Invariant Capital Stock in a two-dimensional planning model

   • Chia-Shin Chung

   OriginalPaper Pages: 201 - 211

7. A generalized linear production model: A unifying model

   • Daniel Granot

   OriginalPaper Pages: 212 - 222

8. A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities

   • Pierre Hansen
   • Brigitte Jaumard
   • Michel Minoux

   OriginalPaper Pages: 223 - 231

9. On Fan's minimax theorem

   • J. M. Borwein
   • D. Zhuang

   OriginalPaper Pages: 232 - 234

10. A nonlinear equation for linear programming

    • P. W. Smith
    • H. Wolkowicz

    OriginalPaper Pages: 235 - 238

11. Even more with the Lemke complementarity algorithm

    • Philip C. Jones

    Short Communication Pages: 239 - 242

12. Nonlinear programming and stationary strategies in stochastic games

    • Jerzy A. Filar
    • Todd A. Schultz

    Short Communication Pages: 243 - 247

13. First announcement and call for papers: International conference on stochastic programming

    Notice Pages: 248 - 249

14. Announcement and call for papers: Optimization days 1986

    Notice Pages: 250 - 250