Optimization Online Digest — February 2003

Applications — OR and Management Sciences

A Study of the Lot-Sizing Polytope
Alper Atamturk, Juan Carlos Munoz

Combinatorial Optimization

On the Representation and Characterization of Fullerene C60
Siemion Fajtlowicz

On counting integral points in a convex rational polytope
Jean B. Lasserre, Eduardo S. Zeron

Infinite Dimensional Optimization

Asymptotic approximation method and its convergence on semi-infinite programming
Zhong-Ping Wan

Integer Programming

On Compact Formulations for Integer Programs Solved by Column Generation
Daniel Villeneuve, Jacques Desrosiers, Marco Luebbecke, Francois Soumis

On the facets of the mixed-integer knapsack polyhedron
Alper Atamturk

Linear, Cone and Semidefinite Programming

Linear Programming support in WSMP
Anshul Gupta

On an Extension of Condition Number Theory to Non-Conic Convex Optimization
Robert M. Freund, Fernando Ordonez

Network Optimization

An annotated bibliography of network interior point methods
Mauricio G. C. Resende, Geraldo Veiga

Nonlinear Optimization

Sequential Penalty Quadratic Programming Filter Methods for Nonlinear Programming
Nie Pu-yan

A Null Space Method for Solving System of Equations
Nie Pu-yan

Optimization Software and Modeling Systems

The Use of Java Arrays for Matrix Computations
Geir Gundersen, Trond Steihaug

A Server for Automated Performance Analysis of Benchmarking Data
Hans D Mittelmann, Armin Pruessner

Other Topics

Optimization problems with equilibrium constraints and their numerical solution
Michal Kocvara, Jiri Outrata

Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms
Guang-Min Wang, Zhong-Ping Wan, Xian-Jia Wang