Volume 99,
Number 1,
January 2004
Volume 99,
Number 2,
March 2004
- Robert M. Freund:
Complexity of convex optimization using geometry-based measures and a reference point.
197-221
- Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey:
On unions and dominants of polytopes.
223-239
- Lisa A. Korf:
Stochastic programming duality: 8 multipliers for unbounded constraints with an application to mathematical finance.
241-259
- Guanglu Zhou, Kim-Chuan Toh:
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming.
261-282
- Arnold Neumaier, Oleg Shcherbina:
Safe bounds in linear and mixed-integer linear programming.
283-296
- Maarten H. van der Vlerk:
Convex approximations for complete integer recourse models.
297-310
- Adam B. Levy, Boris S. Mordukhovich:
Coderivatives in parametric optimization.
311-327
- Darinka Dentcheva, Andrzej Ruszczynski:
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints.
329-350
- Aharon Ben-Tal, A. Goryashko, E. Guslitzer, Arkadi Nemirovski:
Adjustable robust solutions of uncertain linear programs.
351-376
- Nobuo Yamashita, Hiroshige Dan, Masao Fukushima:
On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm.
377-397
Volume 99,
Number 3,
April 2004
Copyright © Fri Dec 4 20:34:02 2009
by Michael Ley (ley@uni-trier.de)