.png){kind=icon}
返回
Linear Programming-Based Preprocessing Algorithm and Tightening Constraints for Multiperiod Blend Scheduling Problems
.png){kind=icon}
PRE
AI
DOI：10.1021/acs.iecr.3c03166.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
NORMALIZED MULTIPARAMETRIC DISAGGREGATION
GLOBAL OPTIMIZATION
CONTINUOUS-TIME
WASTE-WATER
RELAXATIONS
DISCRETIZATION
INEQUALITIES
FORMULATION
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
11.3W
机构
引用论文
.png){kind=icon}
分享收藏On the P-formulation and the split-fraction-formulation for the generalized pooling problem关于广义池化问题的P-公式和分裂分数公式
OAAI
OAAI分享收藏
查看更多内容