1. Testing balancedness and perfection of linear matrices

   • Michele Conforti
   • M. R. Rao

   OriginalPaper Pages: 1 - 18

2. Analysis of a self-scaling quasi-Newton method

   • Jorge Nocedal
   • Ya-xiang Yuan

   OriginalPaper Pages: 19 - 37

3. A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio

   • Ilan Adler
   • Ron Shamir

   OriginalPaper Pages: 39 - 52

4. Concave extensions for nonlinear 0–1 maximization problems

   • Yves Crama

   OriginalPaper Pages: 53 - 60

5. Constraint classification in mathematical programming

   • Arnon Boneh
   • Shahar Boneh
   • Richard J. Caron

   OriginalPaper Pages: 61 - 73

6. An algorithm for solving convex programs with an additional convex—concave constraint

   • Dung Le Muu

   OriginalPaper Pages: 75 - 87

7. Minimization of a quasi-concave function over an efficient set

   • S. Bolintineanu

   OriginalPaper Pages: 89 - 110

8. Bounding multi-stage stochastic programs from above

   • Stein W. Wallace
   • Tiecheng Yan

   OriginalPaper Pages: 111 - 129

9. A copositive Q-matrix which is notR ₀

   • G. S. R. Murthy
   • T. Parthasarathy
   • G. Ravindran

   OriginalPaper Pages: 131 - 135

10. On the complexity of approximating the maximal inscribed ellipsoid for a polytope

    • Leonid G. Khachiyan
    • Michael J. Todd

    OriginalPaper Pages: 137 - 159

11. An O(n ³ L) primal—dual potential reduction algorithm for solving convex quadratic programs

    • Donald Goldfarb
    • Shucheng Liu

    OriginalPaper Pages: 161 - 170

12. Some new results regarding spikes and a heuristic for spike construction

    • Jayaram K. Sankaran

    OriginalPaper Pages: 171 - 195

13. Quantitative stability of variational systems: III.ε-approximate solutions

    • Hedy Attouch
    • Roger J. -B. Wets

    OriginalPaper Pages: 197 - 214

14. A new technique for generating quadratic programming test problems

    • Paul H. Calamai
    • Luis N. Vicente
    • Joaquim J. Júdice

    OriginalPaper Pages: 215 - 231

15. A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes

    • Kazuyuki Sekitani
    • Yoshitsugu Yamamoto

    OriginalPaper Pages: 233 - 249

16. On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems

    • Jonathan M. Borwein

    OriginalPaper Pages: 251 - 261

17. A primal—dual infeasible-interior-point algorithm for linear programming

    • Masakazu Kojima
    • Nimrod Megiddo
    • Shinji Mizuno

    OriginalPaper Pages: 263 - 280

18. A general descent framework for the monotone variational inequality problem

    • Jia Hao Wu
    • Michael Florian
    • Patrice Marcotte

    OriginalPaper Pages: 281 - 300

19. Stochastic programming with simple integer recourse

    • François V. Louveaux
    • Maarten H. van der Vlerk

    OriginalPaper Pages: 301 - 325

20. A class of “onto” multifunctions

    • B. Curtis Eaves
    • Uriel G. Rothblum

    OriginalPaper Pages: 327 - 343

21. A note on sufficient conditions forQ ₀ andQ ₀ ⋂P ₀ matrices

    • G. S. R. Murthy

    OriginalPaper Pages: 345 - 349

22. Ky Fan's N-matrices and linear complementarity problems

    • Jianming Miao

    OriginalPaper Pages: 351 - 356

23. Finding all maximal efficient faces in multiobjective linear programming

    • Paul Armand

    OriginalPaper Pages: 357 - 375

24. Characterization of perturbed mathematical programs and interval analysis

    • John J. Dinkel
    • Marietta J. Tretter

    OriginalPaper Pages: 377 - 384

25. A simple constraint qualification in convex programming

    • X. Zhou
    • F. Sharifi Mokhtarian
    • S. Zlobec

    OriginalPaper Pages: 385 - 397