Bound reduction using pairs of linear inequalities
From MaRDI portal
Publication:2392123
Recommendations
- Three enhancements for optimization-based bound tightening
- Reduction constraints for the global optimization of NLPs
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Feasibility-based bounds tightening via fixed points
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
Cites work
- A branch-and-reduce approach to global optimization
- An algorithmic framework for convex mixed integer nonlinear programs
- An Automatic Method of Solving Discrete Programming Problems
- BARON: A general purpose global optimization software package
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constraint propagation with interval labels
- Deterministic global optimization using interval constraint propagation techniques
- Feasibility-based bounds tightening via fixed points
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization problems and domain reduction strategies
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 757686 (Why is no real title available?)
- Linear programming relaxations of quadratically constrained quadratic programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolving in linear programming
- Reformulations in Mathematical Programming: Definitions and Systematics
- The global solver in the LINDO API
Cited in
(17)- Calculation of bounds on variables satisfying nonlinear inequality constraints
- Domain reduction techniques for global NLP and MINLP optimization
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- A reduction from unbounded linear mixed arithmetic problems into bounded problems
- SUSPECT: MINLP special structure detector for Pyomo
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Global optimality bounds for the placement of control valves in water supply networks
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Feasibility-based bounds tightening via fixed points
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Reduction constraints for the global optimization of NLPs
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Three enhancements for optimization-based bound tightening
- Impact of domain reduction techniques in polynomial optimization: a computational study
- P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints
Describes a project that uses
Uses Software
This page was built for publication: Bound reduction using pairs of linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392123)
