Combinatorially accelerated branch-and-bound method for solving the MIP model of process network synthesis
F Friedler, JB Varga, E Feher, LT Fan - State of the art in global …, 1996 - Springer
F Friedler, JB Varga, E Feher, LT Fan
State of the art in global optimization: computational methods and applications, 1996•SpringerProcess network synthesis (PNS) has enormous practical impact; however, its mixed integer
programming (MIP) model is tedious to solve because it usually involves a large number of
binary variables. The present work elucidates the recently proposed accelerated branch-and-
bound algorithm that exploits the unique feature of the MIP model of PNS. Implementation of
the algorithm is based on the so-called decision-mapping that consistently organizes the
system of complex decisions. The accelerated branch-and-bound algorithm of PNS reduces …
programming (MIP) model is tedious to solve because it usually involves a large number of
binary variables. The present work elucidates the recently proposed accelerated branch-and-
bound algorithm that exploits the unique feature of the MIP model of PNS. Implementation of
the algorithm is based on the so-called decision-mapping that consistently organizes the
system of complex decisions. The accelerated branch-and-bound algorithm of PNS reduces …
Abstract
Process network synthesis (PNS) has enormous practical impact; however, its mixed integer programming (MIP) model is tedious to solve because it usually involves a large number of binary variables. The present work elucidates the recently proposed accelerated branch-and- bound algorithm that exploits the unique feature of the MIP model of PNS. Implementation of the algorithm is based on the so-called decision-mapping that consistently organizes the system of complex decisions. The accelerated branch-and-bound algorithm of PNS reduces both the number and size of the partial problems. The efficacy of the algorithm is demonstrated with a realistic example.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果