Mathematical Programming at OberwolfachHeinz König, Bernhard H. Korte, Klaus Ritter |
Contents
1 Characterizations of adjacency of faces of polyhedra A Bachem | 1 |
Grötschel 1 | 22 |
4 Lagrangean functions and affine minorants R J Duffin and R G | 48 |
Copyright | |
10 other sections not shown
Common terms and phrases
A₁ adjacent affine independence algorithm assume assumptions b₁ Banach space bounded Ca(W cocircuit computational cone(E constraints contains conv(V convergence convex cone convex functions convex set Corollary cost M-flow defined denote derived cone DT-hypotraceable dual E S(W e₁ ellipsoid method equality set equation exists F₁ F₂ facet feasible solution finite function G₁ g₁(x G₂ graph hamiltonian path Hence holds HYPERPLANE hypohamiltonian hypotraceable digraphs implies integer programming iteration join-meet k₁ lagrangean Lemma Let G linear programming linearly independent Mathematical Programming matrix maximal M-flow method minimal valid inequality multifunction node nonempty obtain optimal solution optimal step optimal value oracle order conditions parameters polyhedral polyhedron polytope positive definite Proof Proposition prove regular matroids resp satisfies Section self-transformable sequence solved subadditive subset T₁ Theorem transformation u₁ update formula v₁ variables vectors y₁