1. Condition measures and properties of the central trajectory of a linear program

   • Manuel A. Nunez
   • Robert M. Freund

   OriginalPaper Pages: 1 - 28

2. A variable-penalty alternating directions method for convex optimization

   • Spyridon Kontogiorgis
   • Robert R. Meyer

   OriginalPaper Pages: 29 - 53

3. Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities

   • Christian Kanzow
   • Masao Fukushima

   OriginalPaper Pages: 55 - 87

4. On proving existence of feasible points in equality constrained optimization problems

   • R. Baker Kearfott

   OriginalPaper Pages: 89 - 100

5. Plant location with minimum inventory

   • Francisco Barahona
   • David Jensen

   OriginalPaper Pages: 101 - 111

6. Approximate iterations in Bregman-function-based proximal algorithms

   • Jonathan Eckstein

   OriginalPaper Pages: 113 - 123

7. Warm start of the primal-dual method applied in the cutting-plane scheme

   • Jacek Gondzio

   OriginalPaper Pages: 125 - 143

8. Generalized semi-infinite optimization: A first order optimality condition and examples

   • H. Th. Jongen
   • J. -J. Rückmann
   • O. Stein

   OriginalPaper Pages: 145 - 158

9. Merit functions for semi-definite complemetarity problems

   • Paul Tseng

   OriginalPaper Pages: 159 - 185

10. Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification

    • O. L. Mangasarian

    OriginalPaper Pages: 187 - 194

11. The nucleon of cooperative games and an algorithm for matching games

    • Ulrich Faigle
    • Walter Kern
    • Winfried Hochstättler

    OriginalPaper Pages: 195 - 211

12. Worst-case analyses, linear programming and the bin-packing problem

    • Lap Mui Ann Chan
    • David Simchi-Levi
    • Julien Bramel

    OriginalPaper Pages: 213 - 227

13. Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis

    • Rüdiger Schultz
    • Leen Stougie
    • Maarten H. van der Vlerk

    OriginalPaper Pages: 229 - 252

14. A cellation of the Grassmann manifold

    • B. Curtis Eaves
    • Karl H. Schmedders

    OriginalPaper Pages: 253 - 262

15. Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems

    • Sien Deng

    OriginalPaper Pages: 263 - 276

16. Location and shape of a rectangular facility in ℝⁿ. Convexity properties. Convexity properties

    • E. Carrizosa
    • M. Muñoz-Márquez
    • J. Puerto

    OriginalPaper Pages: 277 - 290

17. On finding an envy-free Pareto-optimal division

    • J. H. Reijnierse
    • J. A. M. Potters

    OriginalPaper Pages: 291 - 311

18. Discrete convex analysis

    • Kazuo Murota

    OriginalPaper Pages: 313 - 371

19. A bundle-Newton method for nonsmooth unconstrained minimization

    • Ladislav Lukšan
    • Jan Vlček

    OriginalPaper Pages: 373 - 391

20. Affine scaling algorithm fails for semidefinite programming

    • Masakazu Muramatsu

    OriginalPaper Pages: 393 - 406

21. Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

    • Josef Stoer
    • Martin Wechs

    OriginalPaper Pages: 407 - 423

22. A branch and bound method for stochastic global optimization

    • Vladimir I. Norkin
    • Georg Ch. Pflug
    • Andrzej Ruszczyński

    OriginalPaper Pages: 425 - 450

23. L-shaped decomposition of two-stage stochastic programs with integer recourse

    • Claus C. Carøe
    • Jørgen Tind

    OriginalPaper Pages: 451 - 464