Variable Bound Tightening and Valid Constraints for Multiperiod Blending

DOI10.1287/ijoc.2021.1140OpenAlexW4213058721MaRDI QIDQ5106407

Yifu Chen, Christos T. Maravelias

Publication date: 19 September 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1140

zbMATH Keywords

reformulation-linearization techniquepreprocessingbilinear termsvariable lifting

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• GitHub
• QPLIB

Cites Work

• Unnamed Item
• Global optimization of bilinear programs with a multiparametric disaggregation technique
• Relaxations and discretizations for the pooling problem
• Three enhancements for optimization-based bound tightening
• New multi-commodity flow formulations for the pooling problem
• Constraint propagation, relational arithmetic in AI systems and mathematical programs
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A finite algorithm for global minimization of separable concave programs
• Domain reduction techniques for global NLP and MINLP optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• A branch-and-reduce approach to global optimization
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
• QPLIB: a library of quadratic programming instances
• Bound reduction using pairs of linear inequalities
• Strong formulations for the pooling problem
• A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines
• Valid Inequalities for the Pooling Problem with Binary Variables
• Presolve Reductions in Mixed Integer Programming
• Branching and bounds tighteningtechniques for non-convex MINLP
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Constraint aggregation for rigorous global optimization

This page was built for publication: Variable Bound Tightening and Valid Constraints for Multiperiod Blending