Non-convex chance-constrained optimization for blending recipe design under uncertainties

• Published in: Computers & chemical engineering Vol. 139; p. 106868
• Main Authors: Yang, Yu, Rosa, Loren dela, Chow, Tsz Yuet Matthew
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 04.08.2020
• Subjects: Chance-constrained program; Gasoline blending; Global optimization; Second-order cone program; Gasoline blending; Second-order cone program; Chance-constrained program; Global optimization
• ISSN: 0098-1354; 1873-4375
• DOI: 10.1016/j.compchemeng.2020.106868

•Using a nonconvex chance-constrained program to model gasoline blending problem.•Nonlinear mixing rule is used for the calculation of octane rating.•Normal distribution is used to describe the feedstock uncertainties.•The chance-constrained program is solved to a near-global optimal solution.•Two grades of gasoline with nine feedstocks are produced in the case study. A global optimization algorithm is proposed to design blending recipes for gasoline production with nonlinear mixing law and parameter uncertainty. Important fuels, such as gasoline, are produced by mixing several intermediate feedstocks in such a way that all quality specifications are met, and total profit is maximized. Conventional blending design approaches that rely on linear models and deterministic optimization may generate a suboptimal or infeasible solution due to model inaccuracy and failure to account for parameter uncertainty. The proposed work designs the blending recipe subject to chance constraints with normally distributed uncertain parameters and nonlinear mixing rule. The resulting non-convex joint chance-constrained program is solved to a near-global optimum through second-order cone relaxation, branch-and-bound, optimality-based bound tightening, and reformulate-linearization techniques. A case study involving nine feedstocks and two grades of gasoline is presented to demonstrate the effectiveness of the proposed method.