{"_id":"fyPNtgkoqef4DMjtm","bibbaseid":"yue-you-reformulationlinearizationmethodforglobaloptimizationofmixedintegerlinearfractionalprogrammingproblemswithapplicationonsustainablebatchscheduling-2014","downloads":0,"creationDate":"2017-12-28T02:43:51.684Z","title":"Reformulation-linearization method for global optimization of mixed integer linear fractional programming problems with application on sustainable batch scheduling","author_short":["Yue, D.","You, F."],"year":2014,"bibtype":"book","biburl":null,"bibdata":{"title":"Reformulation-linearization method for global optimization of mixed integer linear fractional programming problems with application on sustainable batch scheduling","type":"book","year":"2014","source":"Computer Aided Chemical Engineering","identifiers":"[object Object]","keywords":"[MILFP, Mixed-integer linear fractional programmin","volume":"33","id":"6152f511-3d32-3f15-99c4-8596186e781f","created":"2016-08-19T13:20:27.000Z","file_attached":false,"profile_id":"f27171f8-b200-3870-9028-dcb6a084733d","last_modified":"2017-03-25T02:01:24.507Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":false,"abstract":"In this work, we propose a novel approach to the effective global optimization of mixed integer linear fractional programming (MILFP) problems: reformulation-linearization method. The proposed reformulation-linearization method is based on the integration of Charnes-Cooper transformation and Glover's linearization scheme. This method can provide the exact mixed integer linear programming (MILP) reformulation of a general MILFP problem, thus allowing the global optimization of MILFP problems by solving the equivalent MILP problems with the powerful MILP methods, only once. Reformulation and analysis are presented, along with a side-by-side comparison with the other MILFP solution methods. To illustrate its application, we address in this work a case study on sustainable batch scheduling modelled as MILFP problems. The results show that orders of magnitude reduction in CPU times can be achieved when using the proposed approach, compared to solving the problems with the general-purpose MINLP solvers. The proposed method is also shown to have comparable computational performance as the parametric algorithm. ? 2014 Elsevier B.V.","bibtype":"book","author":"Yue, D. and You, F.","bibtex":"@book{\n title = {Reformulation-linearization method for global optimization of mixed integer linear fractional programming problems with application on sustainable batch scheduling},\n type = {book},\n year = {2014},\n source = {Computer Aided Chemical Engineering},\n identifiers = {[object Object]},\n keywords = {[MILFP, Mixed-integer linear fractional programmin},\n volume = {33},\n id = {6152f511-3d32-3f15-99c4-8596186e781f},\n created = {2016-08-19T13:20:27.000Z},\n file_attached = {false},\n profile_id = {f27171f8-b200-3870-9028-dcb6a084733d},\n last_modified = {2017-03-25T02:01:24.507Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {In this work, we propose a novel approach to the effective global optimization of mixed integer linear fractional programming (MILFP) problems: reformulation-linearization method. The proposed reformulation-linearization method is based on the integration of Charnes-Cooper transformation and Glover's linearization scheme. This method can provide the exact mixed integer linear programming (MILP) reformulation of a general MILFP problem, thus allowing the global optimization of MILFP problems by solving the equivalent MILP problems with the powerful MILP methods, only once. Reformulation and analysis are presented, along with a side-by-side comparison with the other MILFP solution methods. To illustrate its application, we address in this work a case study on sustainable batch scheduling modelled as MILFP problems. The results show that orders of magnitude reduction in CPU times can be achieved when using the proposed approach, compared to solving the problems with the general-purpose MINLP solvers. The proposed method is also shown to have comparable computational performance as the parametric algorithm. ? 2014 Elsevier B.V.},\n bibtype = {book},\n author = {Yue, D. and You, F.}\n}","author_short":["Yue, D.","You, F."],"bibbaseid":"yue-you-reformulationlinearizationmethodforglobaloptimizationofmixedintegerlinearfractionalprogrammingproblemswithapplicationonsustainablebatchscheduling-2014","role":"author","urls":{},"keyword":["[MILFP","Mixed-integer linear fractional programmin"],"downloads":0},"search_terms":["reformulation","linearization","method","global","optimization","mixed","integer","linear","fractional","programming","problems","application","sustainable","batch","scheduling","yue","you"],"keywords":["[milfp","mixed-integer linear fractional programmin"],"authorIDs":["5a445a67dd7f81802d00001d"]}