Difference between revisions of "Mixed-integer linear fractional programming (MILFP)"
(66 intermediate revisions by one other user not shown) | |||
Line 1: | Line 1: | ||
Author: Xiang Zhao (SysEn 6800 Fall 2020) | Author: Xiang Zhao (SysEn 6800 Fall 2020) | ||
− | |||
− | |||
==Introduction== | ==Introduction== | ||
− | The mixed-integer linear fractional programming (MILFP) is a kind of mixed-integer nonlinear programming (MINLP) that is widely applied in chemical engineering, environmental engineering, and their hybrid field ranging from cyclic-scheduling problems to the life cycle optimization (LCO). Specifically, the objective function of the MINFP is shown as a ratio of two linear functions formed by various continuous variables and discrete variables. However, the pseudo-convexity and the combinatorial nature of the fractional objective function can cause computational challenges to the general-purpose global optimizers, such as BARON, to solve this MILFP problem. In this regard, we introduce the basic knowledge and solution steps of three algorithms, namely the Parametric Algorithm, Reformulation-Linearization method, and Branch-and-Bound with Charnes-Cooper Transformation Method, to efficiently and effectively tackle this computational challenge. | + | The mixed-integer linear fractional programming (MILFP) is a kind of mixed-integer nonlinear programming (MINLP) that is widely applied in chemical engineering,<sup>[https://aiche.onlinelibrary.wiley.com/doi/full/10.1002/btpr.2479]</sup> environmental engineering,<sup>[http://ourspace.uregina.ca/handle/10294/5449]</sup> and their hybrid field ranging from cyclic-scheduling problems to the life cycle optimization (LCO).<sup>[https://pubs.acs.org/doi/abs/10.1021/acssuschemeng.7b00002?casa_token=hJNBUOc-zyIAAAAA:8gqZM144_Hjovhq_fLHXRQT66FGp0tf6oZ3rWiuRJLD4YKp4f1S44UkUspsNZuCCrcCFIWYME1v0dGPYLA]</sup> Specifically, the objective function of the MINFP is shown as a ratio of two linear functions formed by various continuous variables and discrete variables. However, the pseudo-convexity and the combinatorial nature of the fractional objective function can cause computational challenges to the general-purpose global optimizers, such as [[wikipedia:BARON|BARON]], to solve this MILFP problem.<sup>[https://www.sciencedirect.com/science/article/pii/S0098135413003396?casa_token=Y6pefF84TQAAAAAA:ALrnGQIOGXr3SA-oqbD3FmlFsMyjp_z4zgmY8LkWscSWtbO8pMjFGix35FsroEVxI9ut0mWjffZc]</sup> In this regard, we introduce the basic knowledge and solution steps of three algorithms, namely the Parametric Algorithm, Reformulation-Linearization method, and Branch-and-Bound with Charnes-Cooper Transformation Method, to efficiently and effectively tackle this computational challenge. |
==Standard Form and Properties== | ==Standard Form and Properties== | ||
Consider such standard form of the MILFP: | Consider such standard form of the MILFP: | ||
− | <math>\begin{align}\max | + | <math>\begin{align} \max T(x,y)={c_0+\sum_{i}c_{1,i}m_i+\sum_{j}c_{2,j}y_j \over d_0+\sum_{i}d_{1,i}m_i+\sum_{j}d_{2,j}y_j}\\ |
s.t.\quad\ a_{0,k}+\sum_{i}a_{1,i}m_i+\sum_{j}a_{2,j}y_j=0,\quad \forall k \in K\\ | s.t.\quad\ a_{0,k}+\sum_{i}a_{1,i}m_i+\sum_{j}a_{2,j}y_j=0,\quad \forall k \in K\\ | ||
Line 17: | Line 15: | ||
y_j\in {0,1},\quad \forall j \in J \end{align}</math> | y_j\in {0,1},\quad \forall j \in J \end{align}</math> | ||
− | The properties of the objective function <math> | + | The properties of the objective function <math>T(x,y)</math> are shown as follows:<sup>[https://www.sciencedirect.com/science/article/pii/S0098135409001367?casa_token=Sj60B1tEjccAAAAA:kMeO3BLDWNBd7jkBDqcpR5nTrB3yryQ8_CNqyN1mMooiuZxSiLfoVwtkDuU3cTWu4e0FsmeWN_uw]</sup> |
− | # <math> | + | # <math>T(x,y)</math> is (strictly) pseudoconcave and pseudoconvex over its domain. |
− | # The local | + | # The local optimality of <math>T(x,y)</math> is the same as its global optimality. |
− | Notably, several nonlinear solvers that can deal with the pseudoconvexity, such as the spatial branch-and-bound (SBB), are capable of solving the MILFP. However, the memory usage of these solvers is enormous when solving a large-scale problem that is applied in industrial scheduling or supply chain optimization project. Hence, we introduce the parametric algorithm, and reformulation-linearization method, which can reformulate the MILFP into the mixed-integer linear programming (MILP) problem, to reduce the memory usage and enhance solution efficiency. | + | Notably, several nonlinear solvers that can deal with the pseudoconvexity, such as the spatial branch-and-bound (SBB),<sup>[https://link.springer.com/article/10.1007/BF01106605]</sup> are capable of solving the MILFP. However, the memory usage of these solvers is enormous when solving a large-scale problem that is applied in industrial scheduling or [[wikipedia:supply chain|supply chain]] optimization project. Hence, we introduce the parametric algorithm, and reformulation-linearization method, which can reformulate the MILFP into the mixed-integer linear programming (MILP) problem, to reduce the memory usage and enhance solution efficiency. |
==Parametric Algorithm== | ==Parametric Algorithm== | ||
− | One way to successively reformulate and solve the MILFP is to apply the parametric algorithm, which can find the global optimality within finite iterations. The linearly parametric form of the reformulated objective function has the advantage of directly finding the global | + | One way to successively reformulate and solve the MILFP is to apply the parametric algorithm, which can find the global optimality within finite iterations. The linearly [[wikipedia:parametric form|parametric form]] of the reformulated objective function has the advantage of directly finding the [[wikipedia:global optimum|global optimum]], while the size of the sub-problem remains the same. The reformulation approach is shown as follows: |
The original form of the objective function is: | The original form of the objective function is: | ||
− | <math> | + | <math>T(x,y)={c_0+\sum_{i}c_{1,i}m_i+\sum_{j}c_{2,j}y_j \over d_0+\sum_{i}d_{1,i}m_i+\sum_{j}d_{2,j}y_j}</math> |
− | We use a parametric parameter <math>q</math> to reformulate the objective function <math> | + | We use a parametric parameter <math>q</math> to reformulate the objective function <math>T(x,y)</math> into <math>M(x,y,q)</math>: |
− | <math>\max | + | <math>\max T(x,y)={A(x,y) \over B(x,y)}</math> |
is reformulated into | is reformulated into | ||
− | <math>\max | + | <math>\max M(x,y,q)=A(x,y)-q*B(x,y)</math> |
<math>A(x,y)={c_0+\sum_{i}c_{1,i}m_i+\sum_{j}c_{2,j}y_j}</math> | <math>A(x,y)={c_0+\sum_{i}c_{1,i}m_i+\sum_{j}c_{2,j}y_j}</math> | ||
Line 41: | Line 39: | ||
<math>B(x,y)={d_0+\sum_{i}d_{1,i}m_i+\sum_{j}d_{2,j}y_j}</math> | <math>B(x,y)={d_0+\sum_{i}d_{1,i}m_i+\sum_{j}d_{2,j}y_j}</math> | ||
− | Notably, the optimal solution of the parametric objective function <math> | + | Notably, the optimal solution of the parametric objective function <math>M(x,y,q)</math> has only one zero-point, which is the same as its global optimal solution. Hence, we need to find the zero-point iteratively following the approaches below:<sup>[https://ieeexplore.ieee.org/abstract/document/6858622?casa_token=jvj28BEMe0cAAAAA:utpZe4zST7nz0SVcdNUoX-CjmqmtU_v3CZnU-oTAxvR8B7ZV2iBjyhqDy3s-228w7Aw4_lcJjFw]</sup> |
− | # Initialize the parametric parameter <math>q=0</math>. Set the tolerance <math>tol=10^-6</math> | + | # Initialize the parametric parameter <math>q=0</math>. Set the tolerance <math>tol=10^{-6}</math> |
− | # Solve the sub-problem via using CPLEX, whose objective function is <math> | + | # Solve the sub-problem via using [[wikipedia:CPLEX|CPLEX]], whose objective function is <math>M(x,y,q)</math> with the same original constraints. The optimal solution is <math>x^{*},y^{*}</math>. |
− | # Calculate the value of parametric objective function <math> | + | # Calculate the value of parametric objective function <math>M(x^{*},y^{*},q)=A(x^{*},y^{*})-q*B(x^{*},y^{*})</math>, if the value is within the tolerance <math>tol</math>, then the optimality <math>(x^{*},y^{*})</math> is found. |
− | # Update the parametric parameter <math>q={A(x*,y*) \over B(x*,y*)}</math> and redo step 1. | + | # Update the parametric parameter <math>q={A(x^{*},y^{*}) \over B(x^{*},y^{*})}</math> and redo step 1. |
==Reformulation-Linearization Method== | ==Reformulation-Linearization Method== | ||
− | The reformulation-linearization method, which incorporates the Glover’s linearization into the Charnes-Cooper transformation, introduce auxiliary variables to reformulate the MILFP into equivalent MINLP. The resulting MINLP is subsequently transformed into MILP, which can be efficiently solved by typical MILP solvers like CPLEX, via using Glover’s linearization.The reformulation approach is shown as follows: | + | The reformulation-linearization method, which incorporates the Glover’s linearization into the Charnes-Cooper transformation,<sup>[https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.3800200308?casa_token=BsaOkI0dilIAAAAA:wPELPH83o1FuB9xHW8rRDhwInT3xsGjqqqk6LWID7WYpLexkAhgiymU-4-ew7c0nEoC3wM49-oFHa1m5]</sup> introduce auxiliary variables to reformulate the MILFP into equivalent MINLP. The resulting MINLP is subsequently transformed into MILP, which can be efficiently solved by typical MILP solvers like [[wikipedia:CPLEX|CPLEX]], via using Glover’s linearization.The reformulation approach is shown as follows: |
The original form of the optimization model is: | The original form of the optimization model is: | ||
− | <math>\begin{align}\max | + | <math>\begin{align} \max T(x,y)={c_0+\sum_{i}c_{1,i}m_i+\sum_{j}c_{2,j}y_j \over d_0+\sum_{i}d_{1,i}m_i+\sum_{j}d_{2,j}y_j}\\ |
s.t.\quad\ a_{0,k}+\sum_{i}a_{1,i}m_i+\sum_{j}a_{2,j}y_j=0,\quad \forall k \in K\\ | s.t.\quad\ a_{0,k}+\sum_{i}a_{1,i}m_i+\sum_{j}a_{2,j}y_j=0,\quad \forall k \in K\\ | ||
Line 91: | Line 89: | ||
<math>y_j\in {0,1},\quad \forall j \in J</math> | <math>y_j\in {0,1},\quad \forall j \in J</math> | ||
− | In this regard, we reformulate the original MILFP model into MILP model, which can be effectively solved by typical branch-and-cut solver like CPLEX. To summarize, the reformulated MILP model is shown below: | + | In this regard, we reformulate the original MILFP model into MILP model, which can be effectively solved by a typical [[wikipedia:branch and cut|branch-and-cut]] solver like [[wikipedia:CPLEX|CPLEX]]. To summarize, the reformulated MILP model is shown below: |
− | <math>\begin{align}\max | + | <math>\begin{align}\max W(u,g,h)={c_0*u+\sum_{i}c_{1,i}g_i+\sum_{j}c_{2,j}h_j}\\ |
s.t.\quad\ a_{0,k}*u+\sum_{i}a_{1,i}g_i+\sum_{j}a_{2,j}h_j=0,\quad \forall k \in K\\ | s.t.\quad\ a_{0,k}*u+\sum_{i}a_{1,i}g_i+\sum_{j}a_{2,j}h_j=0,\quad \forall k \in K\\ | ||
Line 116: | Line 114: | ||
==Branch-and-Bound with Charnes-Cooper Transformation Method== | ==Branch-and-Bound with Charnes-Cooper Transformation Method== | ||
− | The integration of the Charnes-Cooper transformation method | + | The integration of the Charnes-Cooper transformation method with the [[wikipedia:Branch and Bound|Branch-and-Bound (B&B)]] algorithm can reformulate the relaxation form of the fractional objective problem in each node into an LP subproblem, which can reach its global optimality via using MILP solvers like [[wikipedia:CPLEX|CPLEX]]. Since solution steps are similar to those of B&B and the reformulation step is shown in Reformulation-Linearization Method, we encourage readers to search for B&B algorithm and paper of Gao et al.<sup>[https://aiche.onlinelibrary.wiley.com/doi/full/10.1002/aic.14705]</sup> |
==Application and Modeling for Numerical Examples== | ==Application and Modeling for Numerical Examples== | ||
− | |||
− | |||
− | In the life-cycle optimization problem of a certain processing system, | + | === Applications of MILFP === |
+ | |||
+ | Two typical applications are introduced in this section, namely [[wikipedia:cyclic scheduling|cyclic scheduling]] and life-cycle optimization.<sup>[https://pubs.acs.org/doi/abs/10.1021/acssuschemeng.7b00631#:~:text=Life%20cycle%20optimization%20(LCO)%20enables,and%20optimization%20of%20process%20alternatives.]</sup> One typical cyclic scheduling problem was illustrated in Yue et al.<sup>[https://www.sciencedirect.com/science/article/pii/S0098135413000781]</sup>, the fractional objective was optimized to reflect both the absolute profit and scheduling aspect, which were shown in the numerator and denominator, respectively. The combination of Reformulation-Linearization method and [[wikipedia:CPLEX|CPLEX]] were regarded as solution algorithm and the optimization framework was applied in a case study corresponding to a multiproduct batch plant that used 14 processing stages for producing three acrylic fiber formulations with a time horizon of 100 h. | ||
+ | |||
+ | In the life-cycle optimization problem of a certain processing system, the unreasonably maximum or minimum treatment amount from optimizing linear objective functions can be avoided via optimizing the fractional objective, and thus the balanced processing amount can be obtained to address the sustainable design and synthesis of this processing system.<sup>[https://pubs.acs.org/doi/abs/10.1021/acssuschemeng.7b03198?casa_token=dokyfl7kzigAAAAA:Z6riBbyfYZgakqA0Qw6du37ClfOFBuBKQxcuExnuWUvniwFWEjx17ivfLo4uvTgsl4eMBukRxfLYXW6dsA]</sup> Notably, the functional unit is shown in the denominator, while the total economic and environmental performances are denoted as numerators in fractional objective functions. Specifically as illustrated in Gong et al.,<sup>[https://aiche.onlinelibrary.wiley.com/doi/full/10.1002/aic.15882]</sup> the sustainable design and synthesis of the shale gas processing system was obtained via optimizing the unit net present value (NPV), unit global warming potential (GWP), and unit freshwater consumption simultaneously. The optimization framework was applied in the Marcella Shale gas site. | ||
+ | |||
+ | In the next two numerical examples, we present a “simple form” of MILFP that can be used for selecting optimal processing pathways via maximizing unit NPV or minimizing unit GWP, respectively. | ||
− | + | === Numerical Examples of MILFP === | |
+ | |||
+ | ==== Introduction of Numerical Examples ==== | ||
− | |||
[[File:Opti wiki.jpg|thumb|right|Figure 1. Superstructure of the chemical processing system]] | [[File:Opti wiki.jpg|thumb|right|Figure 1. Superstructure of the chemical processing system]] | ||
− | Let’s consider a simple chemical plant, whose superstructure is shown | + | Let’s consider a simple chemical plant, whose superstructure is shown on the right side. The superstructure denotes all technology options, and only one of them in each level can be chosen simultaneously. To find the optimal processing pathway on the basis of economic and environmental aspects, we consider maximizing the [[wikipedia:net present value|net present value (NPV)]] or minimizing unit greenhouse gas (GHG) emissions, respectively. Notably, the unit NPV equals the ratio of the NPV with the total mass flow rate of product I within the project lifespan of ten years. The discount rate is 10%. |
− | + | ||
+ | ==== Input Parameters of Numerical Examples ==== | ||
+ | |||
{| class="wikitable" | {| class="wikitable" | ||
− | |+ Conversion Rate of each | + | |+ Conversion Rate of each Chemical |
|- | |- | ||
! Processing Level !! Conversion Rate !! Conversion Rate !! Conversion Rate | ! Processing Level !! Conversion Rate !! Conversion Rate !! Conversion Rate | ||
Line 163: | Line 168: | ||
! A1 !! A2 !! A3 !! B1 !! B2 !! B3 !! C1 !! C2 !! C3 | ! A1 !! A2 !! A3 !! B1 !! B2 !! B3 !! C1 !! C2 !! C3 | ||
|- | |- | ||
− | | | + | | 25 || 30 || 20 || 30 || 28 || 50 || 27 || 25 || 15 |
|} | |} | ||
Line 184: | Line 189: | ||
|} | |} | ||
− | + | ==== Nomenclatures for the Mathematical Model of the Numerical Examples ==== | |
+ | |||
{| class="wikitable" | {| class="wikitable" | ||
|+ Nomenclature | |+ Nomenclature | ||
Line 190: | Line 196: | ||
! Nomenclature !! Meaning | ! Nomenclature !! Meaning | ||
|- | |- | ||
− | | ''I'' || Set of production stages indexed by | + | | ''<math>I</math>'' || Set of production stages indexed by <math>i</math>. |
|- | |- | ||
− | | ''J'' || Set of process alternatives | + | | ''<math>J</math>'' || Set of process alternatives <math>j</math>. |
|- | |- | ||
− | | ''D'' || Demand of product I. | + | | ''<math>D</math>'' || Demand of product I. |
|- | |- | ||
− | | '' | + | | ''<math>CAV_{i,j}</math>'' || Unit variable capital cost in the process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | '' | + | | ''<math>CV_{i,j}</math>'' || Conversion rate from input flow to output flow in the process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | '' | + | | ''<math>FIXI_{i,j}</math>'' || Fixed capital cost in the process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | '' | + | | ''<math>GHG_{i,j}</math>'' || Unit GHG emissions from the process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | '' | + | | ''<math>OPERI_{i,j}</math>'' || Unit operating cost in the process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | ''PRI'' || Price of product I. | + | | ''<math>PRI</math>'' || Price of product I. |
|- | |- | ||
− | | ''PRID'' || Price of chemical D. | + | | ''<math>PRID</math>'' || Price of chemical D. |
|- | |- | ||
− | | ''S'' || Supply of chemical D. | + | | ''<math>S</math>'' || Supply of chemical D. |
|- | |- | ||
− | | '' | + | | ''<math>y_{i,j}</math>'' || 0-1 variable. Equals to one if the process alternative <math>j</math> at the production stage <math>i</math> is selected. |
|- | |- | ||
− | | '' | + | | ''<math>ca_{i,j}</math>'' || Capacity of process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | ''fec'' || Total feedstock cost. | + | | ''<math>fec</math>'' || Total feedstock cost. |
|- | |- | ||
− | | ''fix'' || Total fixed capital cost. | + | | ''<math>fix</math>'' || Total fixed capital cost. |
|- | |- | ||
− | | ''ghgt'' || Total GHG emissions. | + | | ''<math>ghgt</math>'' || Total GHG emissions. |
|- | |- | ||
− | | '' | + | | ''<math>mi_{i,j}</math>'' || Mass flow rate of the feedstock flow to process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | '' | + | | ''<math>mo_{i,j}</math>'' || Mass flow rate of the output flow to process alternative <math>j</math> at the production stage <math>i</math>. |
|- | |- | ||
− | | ''oper'' || Total operating cost. | + | | ''<math>oper</math>'' || Total operating cost. |
|- | |- | ||
− | | ''objc'' || Unit net present value (NPV). | + | | ''<math>objc</math>'' || Unit net present value (NPV). |
|- | |- | ||
− | | ''obje'' || Unit GHG emissions (within one operating year). | + | | ''<math>obje</math>'' || Unit GHG emissions (within one operating year). |
|- | |- | ||
− | | ''npv'' || Net present value. | + | | ''<math>npv</math>'' || Net present value. |
|- | |- | ||
− | | ''sale'' || Total sales. | + | | ''<math>sale</math>'' || Total sales. |
|- | |- | ||
− | | ''vai'' || Total variable capital cost. | + | | ''<math>vai</math>'' || Total variable capital cost. |
|} | |} | ||
− | + | ||
− | + | ===== Mass Balance Constraints ===== | |
+ | |||
<math>mi_{i,j} \leq ca_{i,j},\quad \forall i \in I,\forall j \in J</math> | <math>mi_{i,j} \leq ca_{i,j},\quad \forall i \in I,\forall j \in J</math> | ||
Line 253: | Line 260: | ||
This aforementioned constraint illustrates the conversion of the inlet flow and the outlet flow. | This aforementioned constraint illustrates the conversion of the inlet flow and the outlet flow. | ||
− | <math>\sum_{j}mo_{i-1,j} = \sum_{j}mi_{i,j},\quad \forall i \geq 2,\forall j \in J</math> | + | <math>\sum_{j}mo_{(i-1),j} = \sum_{j}mi_{i,j},\quad \forall i \geq 2,\forall j \in J</math> |
This aforementioned constraint denotes that the summation of mass flow rates of the outlet flows from the previous processing level equals to those of the inlet flows in the next processing level. | This aforementioned constraint denotes that the summation of mass flow rates of the outlet flows from the previous processing level equals to those of the inlet flows in the next processing level. | ||
Line 265: | Line 272: | ||
This aforementioned constraint represents that the summation of mass flow rates of the technology options in the first processing level should be less than the supply of the chemical D. | This aforementioned constraint represents that the summation of mass flow rates of the technology options in the first processing level should be less than the supply of the chemical D. | ||
− | + | ===== Superstructure Configuration Constraints ===== | |
Notably, the superstructure configuration constraints illustrate the logic relationship between each technology option within the superstructure. If the binary variable <math>y_{i,j}</math> equals to 1, than the technology option <math>j</math> in the process level <math>i</math> is selected. | Notably, the superstructure configuration constraints illustrate the logic relationship between each technology option within the superstructure. If the binary variable <math>y_{i,j}</math> equals to 1, than the technology option <math>j</math> in the process level <math>i</math> is selected. | ||
Line 279: | Line 286: | ||
<math>y_{2,2}+y_{2,3}=y_{3,2}+y_{3,3}</math> | <math>y_{2,2}+y_{2,3}=y_{3,2}+y_{3,3}</math> | ||
− | + | ===== Economic Evaluation Constraints ===== | |
We consider the fixed capital cost (<math>fix</math>), variable capital cost (<math>vai</math>), operating cost (<math>oper</math>), and feedstock cost (<math>fec</math>) as the expenses for the chemical processing system. | We consider the fixed capital cost (<math>fix</math>), variable capital cost (<math>vai</math>), operating cost (<math>oper</math>), and feedstock cost (<math>fec</math>) as the expenses for the chemical processing system. | ||
Line 293: | Line 300: | ||
<math>sale=PRI*\sum_{j}mo_{3,j}</math> | <math>sale=PRI*\sum_{j}mo_{3,j}</math> | ||
− | The net present value is calculated in the constraint below (<math>fix</math>), where we account for the total discounted cash flow | + | The net present value is calculated in the constraint below (<math>fix</math>), where we account for the total discounted cash flow and <math>SP</math> represents for the lifespan of the this project. |
− | <math>npv={DR*(1+DR)^{SP} \over (1+DR)^{SP}-1}*(sale-vai | + | <math>npv={DR*(1+DR)^{SP} \over (1+DR)^{SP}-1}*(sale-(vai+oper+fec))-fix</math> |
+ | |||
+ | ===== Environmental Evaluation Constraint ===== | ||
− | |||
The total GHG emissions from the chemical processing system is calculated in the constraint below. | The total GHG emissions from the chemical processing system is calculated in the constraint below. | ||
<math>ghgt=\sum_{i}{\sum_{j}GHG_{i,j}*mi_{i,j}}</math> | <math>ghgt=\sum_{i}{\sum_{j}GHG_{i,j}*mi_{i,j}}</math> | ||
− | + | ===== Objective Functions ===== | |
− | Two numerical examples are presented as optimizing each fractional objective | + | |
+ | Two numerical examples are presented as optimizing each fractional objective function, which is shown as below. Since all constraints denote the relationship between various continuous and discrete variables, two aforementioned numerical problems can be regarded as MILFPs. We consider maximizing unit NPV (<math>obje</math>) or minimizing unit global warming potential [[wikipedia:global warming potential|global warming potential (GWP)]] (<math>objc</math>) in two numerical examples, respectively. | ||
<math>obje={npv \over \sum_{j}mo_{3,j}}</math> | <math>obje={npv \over \sum_{j}mo_{3,j}}</math> | ||
Line 309: | Line 318: | ||
==Solution for Numerical Examples== | ==Solution for Numerical Examples== | ||
− | + | ||
− | We consider the first objective function (<math>obje</math>) and all constraints in the mathematical model, where we can reformulate the objective function into parametric form (<math>obj_1</math>) using parametric parameter <math>q_1</math>: | + | ===Maximizing Unit NPV=== |
+ | |||
+ | We consider the first objective function (<math>obje</math>) and all constraints in the mathematical model, where we can reformulate the objective function into a parametric form (<math>obj_1</math>) using parametric parameter <math>q_1</math>: | ||
<math>\max \quad\ obj_1={npv-q_1*\sum_{j}mo_{3,j}}</math> | <math>\max \quad\ obj_1={npv-q_1*\sum_{j}mo_{3,j}}</math> | ||
Line 316: | Line 327: | ||
<math>s.t.\quad\ Mass \ \ Balance\ \ Constraints, Superstructure\ \ Configuration\ \ Constraints, Economic\ \ Evaluation\ \ Constraints</math> | <math>s.t.\quad\ Mass \ \ Balance\ \ Constraints, Superstructure\ \ Configuration\ \ Constraints, Economic\ \ Evaluation\ \ Constraints</math> | ||
− | This reformulated model can be solved by the CPLEX iteratively, and the solution is shown as follows: | + | This reformulated model can be solved by the [[wikipedia:CPLEX|CPLEX]] iteratively, and the solution is shown as follows: |
{| class="wikitable" | {| class="wikitable" | ||
|+ Process to be built | |+ Process to be built | ||
Line 329: | Line 340: | ||
|} | |} | ||
− | + | {| class="wikitable" | |
− | We consider the first objective function (<math>objc</math>) and all constraints in the mathematical model, where we can reformulate the objective function into parametric form (<math>obj_2</math>) using parametric parameter <math>q_2</math>: | + | |+ Performance |
+ | |- | ||
+ | ! Production Amount (ton/yr) !! Unit NPV ($/ton) !! Unit GHG Emissions (ton CO<sub>2</sub>-eq/ton products) | ||
+ | |- | ||
+ | | 768,000 || 187.75 || 10.18 | ||
+ | |} | ||
+ | |||
+ | ===Minimizing Unit GHG Emissions=== | ||
+ | |||
+ | We consider the first objective function (<math>objc</math>) and all constraints in the mathematical model, where we can reformulate the objective function into a parametric form (<math>obj_2</math>) using parametric parameter <math>q_2</math>: | ||
<math>\min \quad\ obj_2={ghgt-q_2*\sum_{j}mo_{3,j}}</math> | <math>\min \quad\ obj_2={ghgt-q_2*\sum_{j}mo_{3,j}}</math> | ||
Line 336: | Line 356: | ||
<math>s.t.\quad\ Mass\ \ Balance\ \ Constraints, Superstructure\ \ Configuration\ \ Constraints, Environmental\ \ Evaluation\ \ Constraints</math> | <math>s.t.\quad\ Mass\ \ Balance\ \ Constraints, Superstructure\ \ Configuration\ \ Constraints, Environmental\ \ Evaluation\ \ Constraints</math> | ||
− | This reformulated model can be solved by the CPLEX iteratively, and the solution is shown as follows: | + | This reformulated model can be solved by the [[wikipedia:CPLEX|CPLEX]] iteratively, and the solution is shown as follows: |
− | + | {| class="wikitable" | |
+ | |+ Process to be built | ||
+ | |- | ||
+ | ! Level 1 !! Level 2 !! Level 3 | ||
+ | |- | ||
+ | | - || - || - | ||
+ | |- | ||
+ | | A2 || B2 || C2 | ||
+ | |- | ||
+ | | - || - || - | ||
+ | |} | ||
+ | |||
+ | {| class="wikitable" | ||
+ | |+ Performance | ||
+ | |- | ||
+ | ! Production Amount (ton/yr) !! Unit NPV ($/ton) !! Unit GHG Emissions (ton CO<sub>2</sub>-eq/ton products) | ||
+ | |- | ||
+ | | 768,000 || 186.23 || 9.68 | ||
+ | |} | ||
+ | |||
+ | ===Computational performance=== | ||
+ | The computational performances of branch-and-refine algorithm and BARON are shown in the table below, where we find that the former algorithm has advantage over the latter one. The optimal solutions for both algorithm are the same, which illustrates the global optimality of the solution from branch-and-refine algorithm. | ||
+ | {| class="wikitable" | ||
+ | |+ Computational Performance for maximizing unit NPV | ||
+ | |- | ||
+ | ! CPUs for branch-and-refine (s) !! CPUs for BARON (s) | ||
+ | |- | ||
+ | | 0.125 || 98.2 | ||
+ | |} | ||
+ | |||
+ | {| class="wikitable" | ||
+ | |+ Performance for BARON algorithm | ||
+ | |- | ||
+ | ! Production Amount (ton/yr) !! Unit NPV ($/ton) !! Unit GHG Emissions (ton CO<sub>2</sub>-eq/ton products) | ||
+ | |- | ||
+ | | 768,000 || 187.75 || 10.18 | ||
+ | |} | ||
+ | |||
+ | ==Conclusion== | ||
+ | The mixed-integer linear fractional programming (MILFP) is a kind of mixed-integer nonlinear programming (MINLP) that is implemented into evaluating the average performance of a certain project. The Parametric Algorithm, Reformulation-Linearization Method, and Branch-and-Bound with Charnes-Cooper Transformation Method are three typical algorithms that aim to tackle the computational challenge caused by the fractional objective. The optimization framework can be applied to the chemical engineering, environmental engineering, and their combined area such as life-cycle optimization. | ||
+ | |||
+ | ==References== | ||
+ | # Liu, S., Gerontas, S., Gruber, D., Turner, R., Titchener‐Hooker, N. J., & Papageorgiou, L. G. (2017). Optimization‐based framework for resin selection strategies in biopharmaceutical purification process development. Biotechnology Progress, 33(4), 1116-1126. | ||
+ | # Zhu, H. (2014). Inexact fractional optimization for multicriteria resources and environmental management under uncertainty (Doctoral dissertation, Faculty of Graduate Studies and Research, University of Regina). | ||
+ | # Gao, J., & You, F. (2017). Economic and environmental life cycle optimization of noncooperative supply chains and product systems: modeling framework, mixed-integer bilevel fractional programming algorithm, and shale gas application. ACS Sustainable Chemistry & Engineering, 5(4), 3362-3381. | ||
+ | # Zhong, Z., & You, F. (2014). Globally convergent exact and inexact parametric algorithms for solving large-scale mixed-integer fractional programs and applications in process systems engineering. Computers & Chemical Engineering, 61, 90-101. | ||
+ | # You, F., Castro, P. M., & Grossmann, I. E. (2009). Dinkelbach's algorithm as an efficient method to solve a class of MINLP models for large-scale cyclic scheduling problems. Computers & Chemical Engineering, 33(11), 1879-1889. | ||
+ | # Quesada, I., & Grossmann, I. E. (1995). A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization, 6(1), 39-76. | ||
+ | # Zhong, Z., & You, F. (2014, June). Parametric algorithms for global optimization of mixed-integer fractional programming problems in process engineering. In 2014 American Control Conference (pp. 3609-3614). IEEE. | ||
+ | # Charnes, A., & Cooper, W. W. (1973). An explicit general solution in linear fractional programming. Naval Research Logistics Quarterly, 20(3), 449-467. | ||
+ | # Gao, J., & You, F. (2015). Optimal design and operations of supply chain networks for water management in shale gas production: MILFP model and algorithms for the water‐energy nexus. AIChE Journal, 61(4), 1184-1208. | ||
+ | # Gong, J., & You, F. (2017). Consequential life cycle optimization: general conceptual framework and application to algal renewable diesel production. ACS Sustainable Chemistry & Engineering, 5(7), 5887-5911. | ||
+ | # Yue, D., & You, F. (2013). Sustainable scheduling of batch processes under economic and environmental criteria with MINLP models and algorithms. Computers & Chemical Engineering, 54, 44-59. | ||
+ | # Gao, J., & You, F. (2018). Integrated hybrid life cycle assessment and optimization of shale gas. ACS Sustainable Chemistry & Engineering, 6(2), 1803-1824. | ||
+ | # Gong, J., & You, F. (2018). A new superstructure optimization paradigm for process synthesis with product distribution optimization: Application to an integrated shale gas processing and chemical manufacturing process. AIChE Journal, 64(1), 123-143. |
Latest revision as of 07:38, 21 December 2020
Author: Xiang Zhao (SysEn 6800 Fall 2020)
Introduction
The mixed-integer linear fractional programming (MILFP) is a kind of mixed-integer nonlinear programming (MINLP) that is widely applied in chemical engineering,^{[1]} environmental engineering,^{[2]} and their hybrid field ranging from cyclic-scheduling problems to the life cycle optimization (LCO).^{[3]} Specifically, the objective function of the MINFP is shown as a ratio of two linear functions formed by various continuous variables and discrete variables. However, the pseudo-convexity and the combinatorial nature of the fractional objective function can cause computational challenges to the general-purpose global optimizers, such as BARON, to solve this MILFP problem.^{[4]} In this regard, we introduce the basic knowledge and solution steps of three algorithms, namely the Parametric Algorithm, Reformulation-Linearization method, and Branch-and-Bound with Charnes-Cooper Transformation Method, to efficiently and effectively tackle this computational challenge.
Standard Form and Properties
Consider such standard form of the MILFP:
The properties of the objective function are shown as follows:^{[5]}
- is (strictly) pseudoconcave and pseudoconvex over its domain.
- The local optimality of is the same as its global optimality.
Notably, several nonlinear solvers that can deal with the pseudoconvexity, such as the spatial branch-and-bound (SBB),^{[6]} are capable of solving the MILFP. However, the memory usage of these solvers is enormous when solving a large-scale problem that is applied in industrial scheduling or supply chain optimization project. Hence, we introduce the parametric algorithm, and reformulation-linearization method, which can reformulate the MILFP into the mixed-integer linear programming (MILP) problem, to reduce the memory usage and enhance solution efficiency.
Parametric Algorithm
One way to successively reformulate and solve the MILFP is to apply the parametric algorithm, which can find the global optimality within finite iterations. The linearly parametric form of the reformulated objective function has the advantage of directly finding the global optimum, while the size of the sub-problem remains the same. The reformulation approach is shown as follows:
The original form of the objective function is:
We use a parametric parameter to reformulate the objective function into :
is reformulated into
Notably, the optimal solution of the parametric objective function has only one zero-point, which is the same as its global optimal solution. Hence, we need to find the zero-point iteratively following the approaches below:^{[7]}
- Initialize the parametric parameter . Set the tolerance
- Solve the sub-problem via using CPLEX, whose objective function is with the same original constraints. The optimal solution is .
- Calculate the value of parametric objective function , if the value is within the tolerance , then the optimality is found.
- Update the parametric parameter and redo step 1.
Reformulation-Linearization Method
The reformulation-linearization method, which incorporates the Glover’s linearization into the Charnes-Cooper transformation,^{[8]} introduce auxiliary variables to reformulate the MILFP into equivalent MINLP. The resulting MINLP is subsequently transformed into MILP, which can be efficiently solved by typical MILP solvers like CPLEX, via using Glover’s linearization.The reformulation approach is shown as follows:
The original form of the optimization model is:
Firstly, we convert the fractional objective function into a bilinear constraint, as well as a substutional term :
To get the MILP equivalent model, we use the Glover's Linearization to transform the bilinear constraint ():
is equivalent to
In this regard, we reformulate the original MILFP model into MILP model, which can be effectively solved by a typical branch-and-cut solver like CPLEX. To summarize, the reformulated MILP model is shown below:
Branch-and-Bound with Charnes-Cooper Transformation Method
The integration of the Charnes-Cooper transformation method with the Branch-and-Bound (B&B) algorithm can reformulate the relaxation form of the fractional objective problem in each node into an LP subproblem, which can reach its global optimality via using MILP solvers like CPLEX. Since solution steps are similar to those of B&B and the reformulation step is shown in Reformulation-Linearization Method, we encourage readers to search for B&B algorithm and paper of Gao et al.^{[9]}
Application and Modeling for Numerical Examples
Applications of MILFP
Two typical applications are introduced in this section, namely cyclic scheduling and life-cycle optimization.^{[10]} One typical cyclic scheduling problem was illustrated in Yue et al.^{[11]}, the fractional objective was optimized to reflect both the absolute profit and scheduling aspect, which were shown in the numerator and denominator, respectively. The combination of Reformulation-Linearization method and CPLEX were regarded as solution algorithm and the optimization framework was applied in a case study corresponding to a multiproduct batch plant that used 14 processing stages for producing three acrylic fiber formulations with a time horizon of 100 h.
In the life-cycle optimization problem of a certain processing system, the unreasonably maximum or minimum treatment amount from optimizing linear objective functions can be avoided via optimizing the fractional objective, and thus the balanced processing amount can be obtained to address the sustainable design and synthesis of this processing system.^{[12]} Notably, the functional unit is shown in the denominator, while the total economic and environmental performances are denoted as numerators in fractional objective functions. Specifically as illustrated in Gong et al.,^{[13]} the sustainable design and synthesis of the shale gas processing system was obtained via optimizing the unit net present value (NPV), unit global warming potential (GWP), and unit freshwater consumption simultaneously. The optimization framework was applied in the Marcella Shale gas site.
In the next two numerical examples, we present a “simple form” of MILFP that can be used for selecting optimal processing pathways via maximizing unit NPV or minimizing unit GWP, respectively.
Numerical Examples of MILFP
Introduction of Numerical Examples
Let’s consider a simple chemical plant, whose superstructure is shown on the right side. The superstructure denotes all technology options, and only one of them in each level can be chosen simultaneously. To find the optimal processing pathway on the basis of economic and environmental aspects, we consider maximizing the net present value (NPV) or minimizing unit greenhouse gas (GHG) emissions, respectively. Notably, the unit NPV equals the ratio of the NPV with the total mass flow rate of product I within the project lifespan of ten years. The discount rate is 10%.
Input Parameters of Numerical Examples
Processing Level | Conversion Rate | Conversion Rate | Conversion Rate |
---|---|---|---|
Level 1 | D to E: 0.8 | D to F: 0.9 | |
Level 2 | E to G: 0.7 | E to H: 0.8 | F to H: 0.4 |
Level 3 | G to I: 0.5 | H to I: 0.6 |
A1 | A2 | A3 | B1 | B2 | B3 | C1 | C2 | C3 |
---|---|---|---|---|---|---|---|---|
6,000,000 | 7,000,000 | 7,500,000 | 5,000,000 | 6,000,000 | 7,500,000 | 11,000,000 | 10,000,000 | 10,500,000 |
A1 | A2 | A3 | B1 | B2 | B3 | C1 | C2 | C3 |
---|---|---|---|---|---|---|---|---|
50 | 40 | 35 | 60 | 55 | 45 | 30 | 35 | 33 |
A1 | A2 | A3 | B1 | B2 | B3 | C1 | C2 | C3 |
---|---|---|---|---|---|---|---|---|
25 | 30 | 20 | 30 | 28 | 50 | 27 | 25 | 15 |
Item | Supply/Demand | Feedstock/Product Price |
---|---|---|
D | 2,000,000 | 100 |
I | 200,000 | 2000 |
A1 | A2 | A3 | B1 | B2 | B3 | C1 | C2 | C3 |
---|---|---|---|---|---|---|---|---|
1.2 | 0.9 | 0.7 | 1.4 | 1.6 | 1.3 | 2.1 | 2.4 | 2.7 |
Nomenclatures for the Mathematical Model of the Numerical Examples
Nomenclature | Meaning |
---|---|
Set of production stages indexed by . | |
Set of process alternatives . | |
Demand of product I. | |
Unit variable capital cost in the process alternative at the production stage . | |
Conversion rate from input flow to output flow in the process alternative at the production stage . | |
Fixed capital cost in the process alternative at the production stage . | |
Unit GHG emissions from the process alternative at the production stage . | |
Unit operating cost in the process alternative at the production stage . | |
Price of product I. | |
Price of chemical D. | |
Supply of chemical D. | |
0-1 variable. Equals to one if the process alternative at the production stage is selected. | |
Capacity of process alternative at the production stage . | |
Total feedstock cost. | |
Total fixed capital cost. | |
Total GHG emissions. | |
Mass flow rate of the feedstock flow to process alternative at the production stage . | |
Mass flow rate of the output flow to process alternative at the production stage . | |
Total operating cost. | |
Unit net present value (NPV). | |
Unit GHG emissions (within one operating year). | |
Net present value. | |
Total sales. | |
Total variable capital cost. |
Mass Balance Constraints
This aforementioned constraint denotes that the mass flow rate of the inlet flow should not exceed the treatment capacity.
This aforementioned constraint represents that the treatment capacity would be zero if the corresponding technology option is not selected.
This aforementioned constraint illustrates the conversion of the inlet flow and the outlet flow.
This aforementioned constraint denotes that the summation of mass flow rates of the outlet flows from the previous processing level equals to those of the inlet flows in the next processing level.
This aforementioned constraint represents that the summation of mass flow rates of the technology options in the third processing level should be larger than the demand of the product I.
This aforementioned constraint represents that the summation of mass flow rates of the technology options in the first processing level should be less than the supply of the chemical D.
Superstructure Configuration Constraints
Notably, the superstructure configuration constraints illustrate the logic relationship between each technology option within the superstructure. If the binary variable equals to 1, than the technology option in the process level is selected.
Economic Evaluation Constraints
We consider the fixed capital cost (), variable capital cost (), operating cost (), and feedstock cost () as the expenses for the chemical processing system.
The net present value is calculated in the constraint below (), where we account for the total discounted cash flow and represents for the lifespan of the this project.
Environmental Evaluation Constraint
The total GHG emissions from the chemical processing system is calculated in the constraint below.
Objective Functions
Two numerical examples are presented as optimizing each fractional objective function, which is shown as below. Since all constraints denote the relationship between various continuous and discrete variables, two aforementioned numerical problems can be regarded as MILFPs. We consider maximizing unit NPV () or minimizing unit global warming potential global warming potential (GWP) () in two numerical examples, respectively.
Solution for Numerical Examples
Maximizing Unit NPV
We consider the first objective function () and all constraints in the mathematical model, where we can reformulate the objective function into a parametric form () using parametric parameter :
This reformulated model can be solved by the CPLEX iteratively, and the solution is shown as follows:
Level 1 | Level 2 | Level 3 |
---|---|---|
A1 | - | - |
- | B2 | - |
- | - | C3 |
Production Amount (ton/yr) | Unit NPV ($/ton) | Unit GHG Emissions (ton CO_{2}-eq/ton products) |
---|---|---|
768,000 | 187.75 | 10.18 |
Minimizing Unit GHG Emissions
We consider the first objective function () and all constraints in the mathematical model, where we can reformulate the objective function into a parametric form () using parametric parameter :
This reformulated model can be solved by the CPLEX iteratively, and the solution is shown as follows:
Level 1 | Level 2 | Level 3 |
---|---|---|
- | - | - |
A2 | B2 | C2 |
- | - | - |
Production Amount (ton/yr) | Unit NPV ($/ton) | Unit GHG Emissions (ton CO_{2}-eq/ton products) |
---|---|---|
768,000 | 186.23 | 9.68 |
Computational performance
The computational performances of branch-and-refine algorithm and BARON are shown in the table below, where we find that the former algorithm has advantage over the latter one. The optimal solutions for both algorithm are the same, which illustrates the global optimality of the solution from branch-and-refine algorithm.
CPUs for branch-and-refine (s) | CPUs for BARON (s) |
---|---|
0.125 | 98.2 |
Production Amount (ton/yr) | Unit NPV ($/ton) | Unit GHG Emissions (ton CO_{2}-eq/ton products) |
---|---|---|
768,000 | 187.75 | 10.18 |
Conclusion
The mixed-integer linear fractional programming (MILFP) is a kind of mixed-integer nonlinear programming (MINLP) that is implemented into evaluating the average performance of a certain project. The Parametric Algorithm, Reformulation-Linearization Method, and Branch-and-Bound with Charnes-Cooper Transformation Method are three typical algorithms that aim to tackle the computational challenge caused by the fractional objective. The optimization framework can be applied to the chemical engineering, environmental engineering, and their combined area such as life-cycle optimization.
References
- Liu, S., Gerontas, S., Gruber, D., Turner, R., Titchener‐Hooker, N. J., & Papageorgiou, L. G. (2017). Optimization‐based framework for resin selection strategies in biopharmaceutical purification process development. Biotechnology Progress, 33(4), 1116-1126.
- Zhu, H. (2014). Inexact fractional optimization for multicriteria resources and environmental management under uncertainty (Doctoral dissertation, Faculty of Graduate Studies and Research, University of Regina).
- Gao, J., & You, F. (2017). Economic and environmental life cycle optimization of noncooperative supply chains and product systems: modeling framework, mixed-integer bilevel fractional programming algorithm, and shale gas application. ACS Sustainable Chemistry & Engineering, 5(4), 3362-3381.
- Zhong, Z., & You, F. (2014). Globally convergent exact and inexact parametric algorithms for solving large-scale mixed-integer fractional programs and applications in process systems engineering. Computers & Chemical Engineering, 61, 90-101.
- You, F., Castro, P. M., & Grossmann, I. E. (2009). Dinkelbach's algorithm as an efficient method to solve a class of MINLP models for large-scale cyclic scheduling problems. Computers & Chemical Engineering, 33(11), 1879-1889.
- Quesada, I., & Grossmann, I. E. (1995). A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization, 6(1), 39-76.
- Zhong, Z., & You, F. (2014, June). Parametric algorithms for global optimization of mixed-integer fractional programming problems in process engineering. In 2014 American Control Conference (pp. 3609-3614). IEEE.
- Charnes, A., & Cooper, W. W. (1973). An explicit general solution in linear fractional programming. Naval Research Logistics Quarterly, 20(3), 449-467.
- Gao, J., & You, F. (2015). Optimal design and operations of supply chain networks for water management in shale gas production: MILFP model and algorithms for the water‐energy nexus. AIChE Journal, 61(4), 1184-1208.
- Gong, J., & You, F. (2017). Consequential life cycle optimization: general conceptual framework and application to algal renewable diesel production. ACS Sustainable Chemistry & Engineering, 5(7), 5887-5911.
- Yue, D., & You, F. (2013). Sustainable scheduling of batch processes under economic and environmental criteria with MINLP models and algorithms. Computers & Chemical Engineering, 54, 44-59.
- Gao, J., & You, F. (2018). Integrated hybrid life cycle assessment and optimization of shale gas. ACS Sustainable Chemistry & Engineering, 6(2), 1803-1824.
- Gong, J., & You, F. (2018). A new superstructure optimization paradigm for process synthesis with product distribution optimization: Application to an integrated shale gas processing and chemical manufacturing process. AIChE Journal, 64(1), 123-143.