1. Input optimization: I. Optimal realizations of mathematical models

   • S. Zlobec

   OriginalPaper Pages: 245 - 268

2. On the superlinear convergence of a trust region algorithm for nonsmooth optimization

   • Y. Yuan

   OriginalPaper Pages: 269 - 285

3. Distribution sensitivity analysis for stochastic programs with complete recourse

   • Jinde Wang

   OriginalPaper Pages: 286 - 297

4. A finite algorithm for the continuousp-center location problem on a graph

   • Arie Tamir

   OriginalPaper Pages: 298 - 306

5. Solving generalized equations via homotopies

   • Alfonso Reinoza

   OriginalPaper Pages: 307 - 320

6. A note on strong perfectness of graphs

   • M. Preissmann
   • D. de Werra

   OriginalPaper Pages: 321 - 326

7. Stability of the linear complementarity problem at a solution point

   • Cu Duong HA

   OriginalPaper Pages: 327 - 338

8. Supports and convex envelopes

   • Stephen J. Grotzinger

   OriginalPaper Pages: 339 - 347

9. The complexity of anl _p method for discrete Tchebycheff approximation in exact arithmetic

   • A. A. Goldstein

   OriginalPaper Pages: 348 - 356

10. Dealing with degeneracy in reduced gradient algorithms

    • R. S. Dembo
    • J. G. Klincewicz

    OriginalPaper Pages: 357 - 363

11. Call for papers: Seventh Symposium on Mathematical Programming with Data Perturbations

    Notice Pages: 364 - 364

12. Fermat Days: Mathematics for optimization

    Notice Pages: 365 - 365

13. Conference ‘or models on microcomputers’

    Notice Pages: 366 - 366

14. Call for nominations: The 1984 Lanchester prize

    Notice Pages: 367 - 368