Mathematical Programming at Oberwolfach II

Faces of dual transportation polyhedra....Pages 1-8
A submodular network simplex method....Pages 9-31
Uncapacitated lot-sizing: The convex hull of solutions....Pages 32-43
Node-weighted graphs having the König-Egerváry property....Pages 44-63
A polynomial-time test for total dual integrality in fixed dimension....Pages 64-69
Inaccuracy in quasi-Newton methods: Local improvement theorems....Pages 70-85
Orientation of matrices....Pages 86-98
Covering directed and odd cuts....Pages 99-112
Submodular systems and related topics....Pages 113-131
Inner estimates for the generalized gradient of the optimal value function in nonlinear programming....Pages 132-146
Numerical methods for basic solutions of generalized flow networks....Pages 147-166
Modelling with integer variables....Pages 167-184
Multipoint methods for separable nonlinear networks....Pages 185-205
Normal solutions of linear programs....Pages 206-216
Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy....Pages 217-230
Performance of approximate algorithms for global minimization....Pages 231-236
Some optimization problems with extremal operations....Pages 237-251