Stock image for illustration purposes only - book cover, edition or condition may vary.
Decomposition Techniques in Mathematical Programming
Conejo, A.J. (Universidad de Castilla); Castillo, Enrique; Minguez, Roberto; Garcia-Bertrand, Raquel (Universidad de Castilla)
€ 304.25
FREE Delivery in Ireland
Description for Decomposition Techniques in Mathematical Programming
Hardback. Presents a practical approach to decomposition techniques in optimization. This book addresses decomposition in linear programming, mixed-integer linear programming, nonlinear programming, and mixed-integer nonlinear programming, and provides decomposition algorithms as well as heuristic ones. Num Pages: 542 pages, 95 black & white tables, biography. BIC Classification: PBU. Category: (P) Professional & Vocational. Dimension: 297 x 210 x 30. Weight in Grams: 956.
Optimization plainly dominates the design, planning, operation, and c- trol of engineering systems. This is a book on optimization that considers particular cases of optimization problems, those with a decomposable str- ture that can be advantageously exploited. Those decomposable optimization problems are ubiquitous in engineering and science applications. The book considers problems with both complicating constraints and complicating va- ables, and analyzes linear and nonlinear problems, with and without in- ger variables. The decomposition techniques analyzed include Dantzig-Wolfe, Benders, Lagrangian relaxation, Augmented Lagrangian decomposition, and others. Heuristic techniques are also considered. Additionally, a comprehensive sensitivity analysis for characterizing the solution ... Read more
Optimization plainly dominates the design, planning, operation, and c- trol of engineering systems. This is a book on optimization that considers particular cases of optimization problems, those with a decomposable str- ture that can be advantageously exploited. Those decomposable optimization problems are ubiquitous in engineering and science applications. The book considers problems with both complicating constraints and complicating va- ables, and analyzes linear and nonlinear problems, with and without in- ger variables. The decomposition techniques analyzed include Dantzig-Wolfe, Benders, Lagrangian relaxation, Augmented Lagrangian decomposition, and others. Heuristic techniques are also considered. Additionally, a comprehensive sensitivity analysis for characterizing the solution ... Read more
Product Details
Format
Hardback
Publication date
2006
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
542
Condition
New
Number of Pages
542
Place of Publication
Berlin, Germany
ISBN
9783540276852
SKU
V9783540276852
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Decomposition Techniques in Mathematical Programming
From the reviews: "A review of a large variety of optimization models where decomposition is used, and to present the available methods in a clear, illustrative, and application-oriented way. … The large number of examples and exercises with applications from economics and electrical, mechanical, energy, and civil engineering makes the book extremely valuable for people ... Read more