Mathematical Programming at Oberwolfach

Characterizations of adjacency of faces of polyhedra.
Linear programming by an effective method using triangular matrices.
Minimal cost flows in regular matroids.
Lagrangean functions and affine minorants.
Khachiyan’s algorithm for linear programming.
Higher order necessary conditions for an abstract optimization problem.
On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets.
Algorithmic versus axiomatic definitions of matroids.
Characterization of facets for multiple right-hand choice linear programs.
Secant approximation methods for convex optimization.
First and second order sufficient optimality conditions in mathematical programming and optimal control.
Global and superlinear convergence of a class of variable metric methods.
Some continuity properties of polyhedral multifunctions.
On conditions warranting ?-subdifferentiability.
On self-transformable combinatorial problems.
A resource decomposition algorithm for general mathematical programs.