34 pages matching variable decomposition procedure in this book
Results 1-3 of 34
What people are saying - Write a review
We haven't found any reviews in the usual places.
Some basic definitions and results
Continuity of feasible set maps
11 other sections not shown
a(rk accumulation point additively separable affine functions algorithm applied asymptotic convergence augmented Lagrangean Benders Decomposition Burkard closedness codomain compact set considered constraint decomposition procedure continuous w.r.t. convex set Cross Decomposition Dantzig Dantzig-Wolfe Decomposition Decom defined denoted dual master programmes dual programme dual solutions dual space dual subprogrammes duality gaps duality theory fact feasible set map feasible solution finite convergence finite number follows Furthermore Geoffrion gramme implies Integer Linear Programming iteration Lagrangean duality Lemma lower bounds lower semi-continuous Mathematical Programming mixed-integer near-)optimal Non-cyclic behaviour non-linear Nonlinear Programming notion number of steps objective function optimal solution value optimization problem point-to-set map primal and dual primal programme primal solutions primal subprogrammes programming problems Proof prove real-valued relaxed master programmes respect result Section sequence stability strong duality Suppose Theorem Theorem 3.3 tion upper bounds upper semi-continuity value-function variable decomposition procedure