Scholarlink

<p>This paper proposes a strategy to improve the relaxation of the normalized multiparametric disaggregation technique. By introducing additional partitions to continuous variables, a bivariate relaxation scheme, piece-wise normalized disaggregation technique (PNMDT) is developed. The proposed approach is first tested over numerical nonlinear programming examples. Based on such a strategy, a global optimization algorithm is then proposed to handle nonconvex optimization problems which involve plentiful bilinear terms. This proposed algorithm is evaluated through solving common scheduling problems in the petrochemical industry, the multi-period blending problem, and the multi-period crude oil scheduling problem. The computational results show that the proposed method can efficiently improve the quality of relaxation and speed up the convergence by reducing the required iterations within the algorithm procedure.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem

  • 期刊论文

  • 发表日期：

    2025年4月22日

查看全文
  • Lifeng Zhang,
  • Congqin Ge,
  • Yanfeng Zhang,
  • Wenhui Yang,
  • Bingzhen Chen,
  • Zhihong Yuan

摘要

This paper proposes a strategy to improve the relaxation of the normalized multiparametric disaggregation technique. By introducing additional partitions to continuous variables, a bivariate relaxation scheme, piece-wise normalized disaggregation technique (PNMDT) is developed. The proposed approach is first tested over numerical nonlinear programming examples. Based on such a strategy, a global optimization algorithm is then proposed to handle nonconvex optimization problems which involve plentiful bilinear terms. This proposed algorithm is evaluated through solving common scheduling problems in the petrochemical industry, the multi-period blending problem, and the multi-period crude oil scheduling problem. The computational results show that the proposed method can efficiently improve the quality of relaxation and speed up the convergence by reducing the required iterations within the algorithm procedure.