Mathematical Programming, Volume 114

Volume 114, Number 1, July 2008

• Aram V. Arutyunov, E. R. Avakov, Alexey F. Izmailov:
  Necessary optimality conditions for constrained optimization problems under relaxed constraint qualifications. 37-68
  
• Wolfgang Achtziger, Christian Kanzow:
  Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications. 69-99
  
• John Dunagan, Santosh Vempala:
  A simple polynomial-time rescaling algorithm for solving linear programs. 101-114
  
• Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph:
  Efficient robust optimization for robust control with constraints. 115-147
  
• Jan Brinkhuis, Shuzhong Zhang:
  A D{\mathsf{D}}-induced duality and its applications. 149-182
  
• Klaus Jansen, Hu Zhang:
  Approximation algorithms for general packing problems and their application to the multicast congestion problem. 183-206
  

Volume 114, Number 2, August 2008

• Fred Glover, Hanif D. Sherali:
  Second-order cover inequalities. 207-234
  
• Jian-Feng Hu, Ping-Qi Pan:
  An efficient approach to updating simplex multipliers in the simplex algorithm. 235-248
  
• Nilay Noyan, Andrzej Ruszczynski:
  Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints. 249-275
  
• Michele Conforti, Laurence A. Wolsey:
  Compact formulations as a union of polyhedra. 277-289
  
• Jean-Noël Corvellec, Viorica V. Motreanu:
  Nonlinear error bounds for lower semicontinuous functions on metric spaces. 291-319
  
• Guoli Ding, Li Feng, Wenan Zang:
  The complexity of recognizing linear systems with certain integrality properties. 321-334
  
• V. Jeyakumar, G. M. Lee:
  Complete characterizations of stable Farkas' lemma and cone-convex programming duality. 335-347
  
• Defeng Sun, Jie Sun, Liwei Zhang:
  The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming. 349-391
  
• Satoru Iwata, Naonori Kakimura:
  Solving linear programs from sign patterns. 393-418