Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem

Dey, Santanu S.; Kocuk, Burak; Santana, Asteroide

doi:10.1007/s10898-019-00844-4

Cited by 6 publications

(1 citation statement)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For pooling problems, nontrivial upper bounds for bilinear terms can be derived from pipeline capacity between blenders and products . Second-order cone programming relaxations and polyhedral relaxations , for general quadratically constrained programs were adapted to solve pooling problems and MBSPs. Luedtke et al proposed strong relaxations for a nonconvex set involving bilinear terms in a modified formulation of pooling problems.…”

Section: Introductionmentioning

confidence: 99%

Linear Programming-Based Preprocessing Algorithm and Tightening Constraints for Multiperiod Blend Scheduling Problems

Song,

Maravelias

2024

Ind. Eng. Chem. Res.

View full text Add to dashboard Cite

The multiperiod blend scheduling problem has a wide variety of engineering applications and is typically formulated as a nonconvex mixed-integer nonlinear program (MINLP). Such an MINLP is challenging to solve due to a large number of bilinear terms and binary variables. One prevalent solution method is branch and bound, whose efficiency heavily relies on the tightness of the convex relaxation of the MINLP. In this article, we propose new constraints that can be used for tightening such convex relaxation. These constraints are derived from the physical information lost due to relaxation and require solving linear programs during preprocessing. Extensive numerical tests are executed to examine the effectiveness of the proposed methods. The results show that even though hundreds of linear programs may be solved during preprocessing, our new methods can significantly reduce the overall computational time, including both the preprocessing and MINLP solver solution time. Further implications are discussed.

show abstract