Ebook: Mathematical Programming Essays in Honor of George B. Dantzig Part I

---

Content:
Front Matter....Pages -
Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients....Pages 1-13
On the continuity of the value of a linear program and of related polyhedral-valued multifunctions....Pages 14-29
Faces of a polyhedron....Pages 30-42
A dantzig-wolfe decomposition variant equivalent to basis factorization....Pages 43-64
Dual nested decomposition of staircase linear programs....Pages 65-86
A decomposition algorithm for circuit routing....Pages 87-103
On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the ?-form separable convex objective function problem....Pages 104-115
An efficient algorithm for minimizing a multivariate polyhedral function along a line....Pages 116-125
Relationships among linear formulations of separable convex piecewise linear programs....Pages 126-140
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks....Pages 141-157
Basis graphs of greedoids and two-connectivity....Pages 158-165
On the simplex algorithm for networks and generalized networks....Pages 166-178
On the facial structure of scheduling polyhedra....Pages 179-218
Intermediate feasibility in 0–1 integer linear systems....Pages 219-224
Classes of linear programs with integral optimal solutions....Pages 225-237
On general decomposition schemes in mathematical programming....Pages 238-252

---

Content:
Front Matter....Pages -
Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients....Pages 1-13
On the continuity of the value of a linear program and of related polyhedral-valued multifunctions....Pages 14-29
Faces of a polyhedron....Pages 30-42
A dantzig-wolfe decomposition variant equivalent to basis factorization....Pages 43-64
Dual nested decomposition of staircase linear programs....Pages 65-86
A decomposition algorithm for circuit routing....Pages 87-103
On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the ?-form separable convex objective function problem....Pages 104-115
An efficient algorithm for minimizing a multivariate polyhedral function along a line....Pages 116-125
Relationships among linear formulations of separable convex piecewise linear programs....Pages 126-140
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks....Pages 141-157
Basis graphs of greedoids and two-connectivity....Pages 158-165
On the simplex algorithm for networks and generalized networks....Pages 166-178
On the facial structure of scheduling polyhedra....Pages 179-218
Intermediate feasibility in 0–1 integer linear systems....Pages 219-224
Classes of linear programs with integral optimal solutions....Pages 225-237
On general decomposition schemes in mathematical programming....Pages 238-252
....