Abstract
This paper addresses the problem of determining cost-minimal process designs for ideal multi-component distillation columns. The special case of binary distillation was considered in the former work (Ballerstein et al. in Optim Eng 16(2):409–440, 2015. https://doi.org/10.1007/s11081-014-9267-5). Therein, a problem-specific bound-tightening strategy based on monotonic mole fraction profiles of single components was developed to solve the corresponding mixed-integer nonlinear problems globally. In the multi-component setting, the mole fraction profiles of single components may not be monotonic. Therefore the bound-tightening strategy from the binary case cannot be applied directly. In this follow-up paper, a model reformulation for ideal multi-component distillation columns is presented. The reformulation is achieved by suitable aggregations of the involved components. Proofs are given showing that mole fraction profiles of aggregated components are monotonic. This property is then used to adapt the bound-tightening strategy from the binary case to the proposed model reformulation. Computational results are provided that indicate the usefulness of both the model reformulation and the adapted bound tightening technique for deterministic global optimization of ideal multi-component distillation column designs.
This is a preview of subscription content, access via your institution.


References
Achterberg T (2009) SCIP: solving constraint integer programs. Math Program Comput 1(1):1–41. https://doi.org/10.1007/s12532-008-0001-1
Ballerstein M, Kienle A, Kunde C, Michaels D, Weismantel R (2015) Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations. Optim Eng 16(2):409–440. https://doi.org/10.1007/s11081-014-9267-5
Belotti P (2013) Bound reduction using pairs of linear inequalities. J Glob Optim 56(3):787–819. https://doi.org/10.1007/s10898-012-9848-9
Belotti P, Cafieri S, Lee J, Liberti L (2012) On feasibility based bounds tightening. http://www.optimization-online.org/DB_HTML/2012/01/3325.html . hal-00935464. Accessed 1 March 2018
Belotti P, Kirches C, Leyffer S, Linderoth J, Luedtke J, Mahajan A (2013) Mixed-integer nonlinear optimization. Acta Numerica 22:1–131. https://doi.org/10.1017/S0962492913000032
Belotti P, Lee J, Liberti L, Margot F, Wächter A (2009) Branching and bounds tightening techniques for non-convex MINLP. Optim Methods Softw 24(4–5):597–634. https://doi.org/10.1080/10556780903087124
Boukouvala F, Misener R, Floudas CA (2016) Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO. Eur J Oper Res 252(3):701–727. https://doi.org/10.1016/j.ejor.2015.12.018
Caprara A, Locatelli M (2010) Global optimization problems and domain reduction strategies. Math Program 125(1):123–137. https://doi.org/10.1007/s10107-008-0263-4
Domes F, Neumaier A (2010) Constraint propagation on quadratic constraints. Constraints 15(3):404–429. https://doi.org/10.1007/s10601-009-9076-1
GAMS Development Corporation (2016) General algebraic modeling system (GAMS) release 24.7.1. Washington, DC, USA. http://www.gams.com/. Accessed 1 March 2018
Gleixner AM, Berthold T, Müller B, Weltge S (2016) Three enhancements for optimization-based bound tightening. J Glob Optim. https://doi.org/10.1007/s10898-016-0450-4
Hansen P, Jaumard B, Lu SH (1991) An analytical approach to global optimization. Math Program 52(1–3):227–254. https://doi.org/10.1007/BF01582889
HSL (2014) A collection of Fortran codes for large-scale scientific computation. http://www.hsl.rl.ac.uk/. Accessed 1 March 2018
IBM CPLEX (2014). http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/. Accessed 1 March 2018
Kunde C, Michaels D, Micovic J, Lutze P, Górak A, Kienle A (2016) Deterministic global optimization in conceptual process design of distillation and melt crystallization. Chem Eng Process Process Intensif 99:132–142. https://doi.org/10.1016/j.cep.2015.09.010
Mersmann A, Kind M, Stichlmair J (2011) Thermal separation technology. Springer, Heidelberg Dordrecht London New York
Mertens N, Kunde C, Kienle A, Michaels D (2016) A reformulation strategy for deterministic global optimization of ideal multi-component distillation processes. In: 26th European symposium on computer aided process engineering, pp 691–696
Misener R, Floudas CA (2013) GloMIQO: global mixed-integer quadratic optimizer. J Glob Optim 57(1):3–50. https://doi.org/10.1007/s10898-012-9874-7
Nallasivam U, Shah VH, Shenvi AA, Huff J, Tawarmalani M, Agrawal R (2016) Global optimization of multicomponent distillation configurations: 2. Enumeration based global minimization algorithm. AIChE J 62(6):2071–2086. https://doi.org/10.1002/aic.15204
Quesada I, Grossmann IE (1993) Global optimization algorithm for heat exchanger networks. Ind Eng Chem Res 32(3):487–499. https://doi.org/10.1021/ie00015a012
Ratschek H, Rokne J (1995) Interval methods. In: Horst R, Pardalos PM (eds) Handbook of global optimization. Springer, New York, pp 751–828. https://doi.org/10.1007/978-1-4615-2025-2_14
Sahinidis NV (2003) Global optimization and constraint satisfaction: the branch-and-reduce approach. In: Bliek C, Jermann C, Neumaier A (eds) Global optimization and constraint satisfaction. COCOS 2002. Lecture notes in computer science. Springer, Berlin Heidelberg, pp 1–16. https://doi.org/10.1007/978-3-540-39901-8_1
Schichl H, Neumaier A (2005) Interval analysis on directed acyclic graphs for global optimization. J Glob Optim 33(4):541–562. https://doi.org/10.1007/s10898-005-0937-x
Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math Program 103(2):225–249. https://doi.org/10.1007/s10107-005-0581-8
Vigerske S (2013) Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II . https://doi.org/10.18452/16704
Vigerske S, Gleixner A (2017) Scip: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim Methods Softw 0(0):1–31. https://doi.org/10.1080/10556788.2017.1335312
Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math Program 106(1):25–57. https://doi.org/10.1007/s10107-004-0559-y
Acknowledgements
This work is part of the Collaborative Research Centre “Integrated Chemical Processes in Liquid Multiphase Systems.” Financial support from the Deutsche Forschungsgemeinschaft (DFG) is gratefully acknowledged through TRR 63. We also thank Ewald Tews for his support in setting up the computational SCIP infrastructure on our machines.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Proof of Corollary 3
Consider System (29) with parameters \(\alpha _1 \ge \alpha _2 \ge \dots \ge \alpha _n>0\) and variables \((Y,\nu _{\rm r})\). We show that applying the transformation rules (30) to \((Y,\nu _{\rm r})\) and \(\alpha _1,\ldots ,\alpha _n\) leads to System (31) with parameters \(\hat{\alpha }_1 \ge \hat{\alpha }_2 \ge \dots \ge \hat{\alpha }_n > 0\) and with variables \(\hat{X}\), \(\hat{\nu }_{\rm s}\) whose feasible solutions satisfy the conditions of Theorem 1 (and Corollary 2). Note that feasible solutions to System (29) are in one-to-one correspondence to solutions feasible to (31) via the transformation rules (30). As we obtain from Corollary 2 that, for every feasible solution \((\hat{X}, \hat{\nu }_{\rm s})\), the sequences \(\{\hat{X}_{k,\hat{l}_{\rm s}}\}_{\hat{l}_{\rm s}=1}^{\hat{u}+1}\) with \(k=1,\ldots ,n\) are nondecreasing, the corresponding sequences \(\{Y_{k,l_{\rm r}}\}_{l_{\rm r}=1}^{u+1}\), \(k=1,\ldots ,n\) are nonincreasing.
The first part of System (29) is given as a combination of the mass balance equations (14) and the inverted phase equilibrium equations (28).
for \(k=1,\ldots ,n\) and \(l_{\rm r}=1,\ldots ,u\). We apply the transformation rules (30) to each constraint, separately. Recap that after the transformation, the components appear in reverse order. To indicate that, we introduce a new index \(m := n-k\).
For all \(k=1,\ldots ,n\) and all \(l=1,\ldots ,u\), we obtain
Thus, the transformation rules (30) yield
For the inverted phase equilibrium equations, we further derive that
holds for every \(k=1,\ldots ,n\) and for every \(l=1,\ldots ,u\). By an index shift \(p:=n+1-j\), we derive the equivalence to the non-inverted phase equilibrium equations (16).
Combining the Eqs. (35) and (36), we obtain the first line from System (31).
The second line of System (31) results from the following relation.
The third line of System (31) trivially holds.
It remains to argue that the transformed constant relative volatilities \(\hat{\alpha }_m = \alpha ^{-1}_{(n+1)-m}\), \(m=1,\ldots ,n\), are strictly positive and monotonically nondecreasing in the new ordering of the components. This, however, holds as \(\alpha _1 \ge \dots \ge \alpha _{n}> 0\) implies that
Now, we can conclude that any feasible solution to System (31) satisfies the conditions of Theorem 1 and Corollary 2. \(\square\)
Appendix 2: Proof of Lemma 6 and Lemma 7
We only give a proof for Lemma 6 dealing with the stripping section. The correctness of Lemma 7 can be shown in a similar way.
In what follows, the superscript “strip” is omitted.
Proof
(Lemma 6) We interpret the aggregated phase equilibrium equations (16)
as functions in the liquid phase concentration variables. For all \(k,q=1,\dots ,n\) and for all \(l_{\rm s} = 1,\ldots ,u+1\), we consider the partial derivatives \(\frac {\partial Y_{k,l_{\rm{s}}}(\varvec{X})}{\partial X_{q,l_{\rm{s}}}}\) where we distinguish the three cases \(q\le k-1\), \(q=k\) and \(q\ge k+1\). To simplify the notation, we introduce the constant \(\alpha _{n+1} := 0\).
For \(q\le k-1\), we obtain
As \((\alpha _q - \alpha _{q+1}) \ge 0\) holds, this derivative is non-negative for all \(k=1,\ldots ,n\) and all \(l_{\rm s}=1,\ldots ,u+1\).
For \(q= k\) we obtain
which is also non-negative for all \(q=1,\ldots ,n\) and all \(l_{\rm s}=1,\ldots ,u+1\).
For \(q\ge k+1\) we obtain
which is non-positive for all \(k=1,\ldots ,n\) and all \(l_{\rm s}=1,\ldots ,u+1\) due to \((\alpha _q - \alpha _{q+1}) \ge 0\).
This shows that the phase equilibrium equations are component-wise monotonic. Therefore, we can apply simple interval arithmetic, again, leading to the following lower and upper bounds on the vapor phase concentration variables \(Y_{k,l_{\rm s}+1}\):
where for \(j= 1,\ldots ,n\)
We remark that the upper bound \(Y_{k,l_{\rm{s}}}^{\text{up}}\) on \(Y_{k,l_{\rm s}}\) is not tight when \(X_{k,l_{\rm s}}^{\rm{up}} > X_{k^\prime ,l_{\rm s}}^{\rm{lo}}\) holds for some \(k^\prime > k\). In those cases, we can compute an improved upper bound on \(Y_{k,l_{\rm s}}\) by finding the maximum of
restricted to \(X_{k',l_{\rm s}}^{\rm{lo}}\le X_{k,l_{\rm s}} \le X_{k',l_{\rm s}} \le X_{k,l_{\rm s}}^{\rm{up}}\). As \(\frac {\partial Y_{k,l_{\rm s}}(\varvec{X})}{\partial X_{k,l_{\rm s}}} \ge 0\) and \(\frac {\partial Y_{k,l_{\rm s}}(\varvec{X})}{\partial X_{k^\prime ,l_{\rm s}}} \le 0\), it follows that \(X_{k,l_{\rm s}}= X_{k',l_{\rm s}}\) must hold for a solution on that the maximum is attained. A comparison of the Eq. (37) and (38) gives rise to the following relation:
This shows that the maximum is attained when \(X_{k,l_{\rm s}} = X_{k',l_{\rm s}}= X_{k,l_{\rm s}}^{\rm{up}}\). Hence, we can replace the definition of \(X_{j,l_{\rm{s}}}^{b_k}\) in Eq. (39) by
This completes the proof. \(\square\)
Rights and permissions
About this article
Cite this article
Mertens, N., Kunde, C., Kienle, A. et al. Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns. Optim Eng 19, 479–514 (2018). https://doi.org/10.1007/s11081-018-9377-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11081-018-9377-6
Keywords
- Deterministic global optimization
- Bound tightening
- Model reformulation
- Distillation