Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints

DOI10.1007/S10898-004-2705-8zbMath1080.90087OpenAlexW2103962598MaRDI QIDQ2576448

Mohit Tawarmalani, Nikolaos V. Sahinidis

Publication date: 13 December 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-2705-8

zbMATH Keywords

SatisfiabilityBARONPooling problemFirst-order optimality conditionsMathematical programming modeling languagesReformulation-linearization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (14)

Pooling problems with polynomial-time algorithms ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ A multi-commodity flow formulation for the generalized pooling problem ⋮ Strong formulations for the pooling problem ⋮ Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Portfolio optimization for wealth-dependent risk preferences ⋮ Valid Inequalities for the Pooling Problem with Binary Variables ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ Reachability Analysis and Deterministic Global Optimization of DAE Models ⋮ The computational complexity of the pooling problem ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs

Uses Software

• INTOPT_90
• MINOPT
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Global minimization by reducing the duality gap
• Rigorous global search: continuous problems
• A finite algorithm for global minimization of separable concave programs
• Convex extensions and envelopes of lower semi-continuous functions
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A branch-and-reduce approach to global optimization
• BARON: A general purpose global optimization software package
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• Improving Discrete Model Representations via Symmetry Considerations
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• An Algorithm for Separable Nonconvex Programming Problems
• Semidefinite relaxations of fractional programs via novel convexification techniques
• The NOP-2 modeling language for nonlinear programming

This page was built for publication: Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints