Mathematical Programming at Oberwolfach

Characterizations of adjacency of faces of polyhedra....Pages 1-22
Linear programming by an effective method using triangular matrices....Pages 23-31
Minimal cost flows in regular matroids....Pages 32-47
Lagrangean functions and affine minorants....Pages 48-60
Khachiyan’s algorithm for linear programming....Pages 61-68
Higher order necessary conditions for an abstract optimization problem....Pages 69-76
On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets....Pages 77-97
Algorithmic versus axiomatic definitions of matroids....Pages 98-111
Characterization of facets for multiple right-hand choice linear programs....Pages 112-142
Secant approximation methods for convex optimization....Pages 143-162
First and second order sufficient optimality conditions in mathematical programming and optimal control....Pages 163-177
Global and superlinear convergence of a class of variable metric methods....Pages 178-205
Some continuity properties of polyhedral multifunctions....Pages 206-214
On conditions warranting Φ-subdifferentiability....Pages 215-224
On self-transformable combinatorial problems....Pages 225-243
A resource decomposition algorithm for general mathematical programs....Pages 244-257