Mathematical Programming at Oberwolfach (Mathematical Programming Studies)

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. Edited By H. König, B. Korte, K. Ritter.