Bound reduction using pairs of linear inequalities
From MaRDI portal
Publication:2392123
DOI10.1007/s10898-012-9848-9zbMath1272.90033OpenAlexW2080552139MaRDI QIDQ2392123
Publication date: 1 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9848-9
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, SUSPECT: MINLP special structure detector for Pyomo, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Domain reduction techniques for global NLP and MINLP optimization, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, Three enhancements for optimization-based bound tightening, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, Global optimality bounds for the placement of control valves in water supply networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithmic framework for convex mixed integer nonlinear programs
- Constraint propagation with interval labels
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Presolving in linear programming
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Global optimization problems and domain reduction strategies
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Feasibility-Based Bounds Tightening via Fixed Points
- An Automatic Method of Solving Discrete Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Reformulations in Mathematical Programming: Definitions and Systematics
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Deterministic global optimization using interval constraint propagation techniques
