1. Sequential location-allocation problems on chains and trees with probabilistic link demands

   • Tom M. Cavalier
   • Hanif D. Sherali

   OriginalPaper Pages: 249 - 277

2. A convex-like duality scheme for quasi-convex programs

   • U. Passy
   • E. Z. Prisman

   OriginalPaper Pages: 278 - 300

3. On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials

   • James Renegar

   OriginalPaper Pages: 301 - 318

4. On the cost of approximating all roots of a complex polynomial

   • James Renegar

   OriginalPaper Pages: 319 - 336

5. A projected lagrangian algorithm for semi-infinite programming

   • I. D. Coope
   • G. A. Watson

   OriginalPaper Pages: 337 - 356

6. Ratios of affine functions

   • Uriel G. Rothblum

   OriginalPaper Pages: 357 - 365

7. On market prices in linear production games

   • Richard Engelbrecht-Wiggans
   • Daniel Granot

   OriginalPaper Pages: 366 - 370