Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Computational Experience with Piecewise-Linear Relaxations for Petroleum Refinery Planning

Version 1 : Received: 27 February 2021 / Approved: 3 March 2021 / Online: 3 March 2021 (11:51:40 CET)

How to cite: Rana, Z.A.; Khor, C.S. Computational Experience with Piecewise-Linear Relaxations for Petroleum Refinery Planning. Preprints 2021, 2021030131 (doi: 10.20944/preprints202103.0131.v1). Rana, Z.A.; Khor, C.S. Computational Experience with Piecewise-Linear Relaxations for Petroleum Refinery Planning. Preprints 2021, 2021030131 (doi: 10.20944/preprints202103.0131.v1).

Abstract

Refinery planning optimization is a challenging problem as regards handling the nonconvex bilinearity mainly due to pooling operations in processes such as crude oil distillation and product blending. This work investigates the performance of several representative piecewise-linear (or piecewise-affine) relaxation schemes (referred to as McCormick, bm, nf5, nf6t, and de (which is a new approach proposed based on eigenvector decomposition) that mainly give rise to mixed-integer optimization programs to convexify a bilinear term using predetermined univariate partitioning for instances of uniform and non-uniform partition sizes. Computational results show that applying these schemes give improved relaxation tightness than only applying convex and concave envelopes as estimators. Uniform partition sizes typically perform better in terms of relaxation solution quality and convergence behavior. It is also seen that there is a limit on the number of partitions that contributes to relaxation tightness, which does not necessarily correspond to a larger number of partitions, while a direct relation between relaxation size and tightness does not always hold for non-uniform partition sizes.

Subject Areas

piecewise-linear relaxation; refinery planning; nonconvex; bilinear; nonlinear programming (NLP); mixed-integer linear programming (MILP)

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.