Preface | p. xiii |
Acknowledgments | p. xvii |
List of Figures | p. xix |
List of Tables | p. xxiii |
Introduction | p. 1 |
The Mixed-Integer Nonlinear Program | p. 5 |
Branch-and-Bound | p. 6 |
Illustrative Example | p. 8 |
A Separable Relaxation | p. 9 |
Tighter Relaxation | p. 12 |
Optimality-Based Range Reduction | p. 12 |
Drawing Inferences from Constraints | p. 16 |
Branching on the Incumbent | p. 17 |
Outline of this Book | p. 18 |
Convex Extensions | p. 25 |
Introduction | p. 26 |
Convex Extensions of l.s.c. Functions | p. 29 |
Multilinear Functions | p. 40 |
Analysis of Convex Underestimators of x/y | p. 43 |
Convex Envelope of x/y | p. 44 |
Closed-Form Expression of Convex Envelope | p. 45 |
Theoretical Comparison of Underestimators | p. 47 |
Numerical Example | p. 52 |
Concave Envelope of x/y | p. 56 |
Relaxing the Positivity Requirement | p. 57 |
Semidefinite Relaxation of x/y | p. 60 |
Generalizations and Applications | p. 62 |
Envelopes of (ax + by)/(cx + dy) | p. 64 |
Convex Envelope of f(x)y[superscript 2] | p. 65 |
Convex Envelope of f(x)/y | p. 69 |
Summation of Functions | p. 69 |
Product Disaggregation | p. 71 |
Introduction | p. 72 |
Preliminaries | p. 75 |
Reformulations of a Rational Function | p. 77 |
Tightness of the Reformulation Scheme | p. 81 |
Special Instances of the Reformulation | p. 91 |
Examples of the Reformulation Scheme | p. 93 |
Example 1: Hock & Schittkowski (1981) | p. 94 |
Example 2: Nuclear Reactor Reload Pattern Design | p. 95 |
Example 3: Catalyst Mixing for Packed Bed Reactor | p. 97 |
Reformulations of Hyperbolic Programs | p. 100 |
Upper Bounding of 0-1 Hyperbolic Programs | p. 105 |
A Branch-and-Bound Algorithm | p. 108 |
Cardinality Constrained Hyperbolic Programs | p. 110 |
Computational Results for CCH Programs | p. 111 |
Comparison of Bounds | p. 112 |
Performance of the Proposed Algorithm | p. 112 |
p-Choice Facility Location | p. 115 |
Relaxations of Factorable Programs | p. 125 |
Nonlinear Relaxation Construction | p. 125 |
Concavoconvex Functions | p. 130 |
Polyhedral Outer-Approximation | p. 132 |
Domain Reduction | p. 147 |
Preliminaries | p. 147 |
Legendre-Fenchel Transform | p. 148 |
Lagrangian Relaxation | p. 152 |
An Iterative Algorithm for Domain Reduction | p. 153 |
Theoretical Framework: Abstract Minimization | p. 154 |
Application to Traditional Models | p. 160 |
Geometric Intuition | p. 163 |
Domain Reduction Problem: Motivation | p. 163 |
Relation to Earlier Works | p. 164 |
Bounds Via Monotone Complementarity | p. 177 |
Tightening using Reduced Costs | p. 178 |
Linearity-based Tightening | p. 179 |
Probing | p. 181 |
Learning Reduction Procedure | p. 183 |
Node Partitioning | p. 189 |
Introduction | p. 189 |
Partitioning Factorable Programs | p. 190 |
Branching Variable Selection | p. 190 |
Branching Point Selection | p. 194 |
Finiteness Issues | p. 196 |
Stochastic Integer Programs | p. 197 |
The Question of Finiteness | p. 198 |
Key to Finiteness | p. 199 |
Lower Bounding Problem | p. 200 |
Upper Bounding | p. 202 |
Branching Scheme | p. 203 |
Finiteness Proof | p. 205 |
Enhancements | p. 205 |
Extension to Mixed-Integer Recourse | p. 207 |
Computational Results for Stochastic Programs | p. 207 |
Implementation | p. 213 |
Design Philosophy | p. 213 |
Programming Languages and Portability | p. 215 |
Supported Optimization Solvers | p. 216 |
Data Storage and Associated Algorithms | p. 216 |
Management of Work-Array | p. 216 |
List of Open Nodes | p. 217 |
Module Storage: Factorable Programming | p. 218 |
Evaluating Derivatives | p. 219 |
Algorithmic Enhancements | p. 221 |
Multiple Solutions | p. 221 |
Local Upper Bounds | p. 222 |
Postponement | p. 222 |
Finite Branching Schemes | p. 223 |
Debugging Facilities | p. 224 |
BARON Interface | p. 224 |
Refrigerant Design Problem | p. 229 |
Introduction | p. 229 |
Problem Statement | p. 230 |
Previous Work | p. 231 |
Optimization Formulation | p. 232 |
Modeling Physical Properties | p. 235 |
Modeling Structural Constraints | p. 239 |
Multiple Solutions | p. 249 |
Computational Results | p. 249 |
The Pooling Problem | p. 253 |
Introduction | p. 254 |
The p- and q-Formulations | p. 256 |
The p-Formulation | p. 256 |
The q-Formulation | p. 261 |
The pq-Formulation | p. 264 |
Properties of the pq-Formulation | p. 266 |
Lagrangian Relaxations | p. 273 |
Global Optimization of the Pooling Problem | p. 276 |
Branching Strategy | p. 278 |
Computational Experience | p. 279 |
Miscellaneous Problems | p. 285 |
Separable Concave Quadratic Programs | p. 285 |
Indefinite Quadratic Programs | p. 289 |
Linear Multiplicative Programs | p. 293 |
Generalized Linear Multiplicative Programs | p. 297 |
Univariate Polynomial Programs | p. 298 |
Miscellaneous Benchmark Problems | p. 298 |
Selected Mixed-Integer Nonlinear Programs | p. 305 |
Design of Just-in-Time Flowshops | p. 305 |
The Gupta-Ravindran Benchmarks | p. 311 |
GAMS/BARON: A Tutorial | p. 313 |
Introduction | p. 314 |
Types of Problems GAMS/BARON Can Solve | p. 315 |
Factorable Nonlinear Programming: MIP, NLP, and MINLP | p. 315 |
Special Cases of BARON's Factorable Nonlinear Programming Solver | p. 316 |
Software and Hardware Requirements | p. 320 |
Model Requirements | p. 320 |
Variable and Expression Bounds | p. 320 |
Allowable Nonlinear Functions | p. 321 |
How to Run GAMS/BARON | p. 321 |
System Output | p. 322 |
System Log | p. 322 |
Termination Messages, Model and Solver Status | p. 324 |
Algorithmic and System Options | p. 325 |
Application to Multiplicative Programs | p. 325 |
LMPs of Type 1 | p. 326 |
Controlling Local Search Requirements | p. 329 |
Reducing Memory Requirements via Branching Options | p. 331 |
Controlling Memory Requirements via Probing | p. 333 |
Effects of Reformulation | p. 334 |
LMPs of Type 2 | p. 335 |
Controlling Time Spent on Preprocessing LPs | p. 339 |
LMPs of Type 3 | p. 342 |
Comparison with Local Search | p. 347 |
Application to Pooling Problems | p. 356 |
Controlling Time Spent in Preprocessing | p. 364 |
Reducing Memory Requirements | p. 368 |
Controlling the Size of the Search Tree | p. 368 |
Controlling Local Search Time During Navigation | p. 371 |
Reduced Branching Space | p. 371 |
Pooling Problem Computations | p. 372 |
Problems from globallib and minlplib | p. 376 |
Local Landscape Analyzer | p. 380 |
Finding the K Best or All Feasible Solutions | p. 383 |
Motivation and Alternative Approaches | p. 383 |
Finding All Solutions to Combinatorial Optimization Problems | p. 385 |
Refrigerant Design Problem | p. 391 |
Finding All Solutions to Systems of Nonlinear Equations | p. 394 |
GAMS Models for Pooling Problems | p. 403 |
Problems Adhya 1, 2, 3, and 4 | p. 403 |
Problems Bental 4 and 5 | p. 411 |
Problems Foulds 2, 3, 4, and 5 | p. 416 |
Problems Haverly 1, 2, and 3 | p. 428 |
Problem RT 2 | p. 431 |
Bibliography | p. 435 |
Index | p. 463 |
Author Index | p. 469 |
Table of Contents provided by Ingram. All Rights Reserved. |