Integrated methods for optimization

by John N. Hooker

Year of publication:	2012
Authors:	Hooker, John
Publisher:	Boston, MA : Springer Science+Business Media, LLC
Subject:	Optimierung \| Methode \| Integration
Description of contents:	Description [zbmath.org]

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Extent:	Online-Ressource v.: digital
Series:	International Series in Operations Research & Management Science ; 170
Type of publication:	Book / Working Paper
Language:	English
Notes:	Description based upon print version of record ""Integrated Methods for Optimization""; ""Preface""; ""Contents""; ""Chapter 1 Introduction""; ""1.1 A Unifying Framework""; ""1.2 Modeling to Reveal Problem Structure""; ""1.3 The Role of Duality""; ""1.4 Advantages of Integrated Methods""; ""1.5 Some Applications""; ""1.6 Software""; ""1.7 Plan of the Book""; ""1.8 Bibliographic Notes""; ""Chapter 2 Examples""; ""2.1 Basic Definitions""; ""2.2 The Solution Process""; ""2.3 Freight Transfer""; ""2.3.1 Formulating the Problem""; ""2.3.2 Inference: Bounds Propagation""; ""2.3.3 Inference: Valid Inequalities"" ""2.3.4 Relaxation: Linear Programming""""2.3.5 Branching Search""; ""Exercises""; ""2.4 Production Planning""; ""2.4.1 Formulating the Problem""; ""2.4.2 Relaxation""; ""2.4.3 Branching Search""; ""2.4.4 Inference""; ""Exercises""; ""2.5 Employee Scheduling""; ""2.5.1 Formulating the Problem""; ""2.5.2 Inference: Domain Filtering""; ""2.5.3 Inference for Variable Indices""; ""Exercises""; ""2.6 Continuous Global Optimization""; ""2.6.1 Inference: Bounds Propagation""; ""2.6.2 Relaxation: Factored Functions""; ""2.6.3 Branching Search""; ""Exercises""; ""2.7 Product Configuration"" ""2.7.1 Formulating the Problem""""2.7.2 Inference: Indexed Linear Constraint""; ""2.7.3 Relaxation: Indexed Linear Constraint""; ""2.7.4 Branching Search""; ""Exercises""; ""2.8 Planning and Scheduling""; ""2.8.1 Formulating the Problem""; ""2.8.2 Relaxation: The Master Problem""; ""2.8.3 Inference: Benders Cuts""; ""Exercises""; ""2.9 Routing and Frequency Assignment""; ""2.10 Bibliographic Notes""; ""Chapter 3 Optimization Basics""; ""3.1 Linear Programming""; ""3.1.1 Optimality Conditions""; ""3.1.2 Simplex Method""; ""3.1.3 Sensitivity Analysis""; ""3.1.4 Feasibility Conditions"" ""Exercises""""3.2 Network Flows""; ""3.2.1 Basis Tree Theorem""; ""3.2.2 Optimality Conditions""; ""3.2.3 Network Simplex Method""; ""3.2.4 Maximum Flow""; ""3.2.5 Bipartite Matching""; ""3.2.6 Exercises""; ""3.3 Nonlinear Programming""; ""3.3.1 Local Optimality Conditions""; ""3.3.2 Global Optimality Conditions""; ""Exercises""; ""3.4 Dynamic Programming""; ""3.4.1 State Variables""; ""3.4.2 Recursive Solution""; ""3.4.3 Complexity""; ""Exercises""; ""3.5 Bibliographic Notes""; ""Chapter 4 Duality""; ""4.1 Inference Duality""; ""4.1.1 Weak and Strong Duality"" ""4.1.2 Certificates and Problem Complexity""""4.1.3 Sensitivity Analysis""; ""4.1.4 Constraint-Directed Search""; ""Exercises""; ""4.2 Relaxation Duality""; ""Exercises""; ""4.3 Linear Programming Duality""; ""4.3.1 Inference Dual""; ""4.3.2 Dual Simplex Method""; ""4.3.3 Sensitivity Analysis""; ""4.3.4 Relaxation Dual""; ""Exercises""; ""4.4 Surrogate Duality""; ""4.4.1 Inference Dual""; ""4.4.2 Sensitivity Analysis""; ""4.4.3 Relaxation Dual""; ""Exercise""; ""4.5 Lagrangean Duality""; ""4.5.1 Inference Dual""; ""4.5.2 Sensitivity Analysis""; ""4.5.3 Relaxation Dual"" ""4.5.4 Lagrangean Relaxation for LP""
ISBN:	978-1-4614-1900-6 ; 978-1-4614-1899-3
Other identifiers:	10.1007/978-1-4614-1900-6 [DOI]
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10014275317

A service of the