A reformulation-linearization method for the global optimization of large-scale mixed-integer linear fractional programming problems and cyclic scheduling application

Global optimization of large-scale mixed-integer linear fractional programs (MILFPs) could be computationally intractable due to the presence of discrete variables and the pseudoconvex/pseudoconcave objective function. In this paper, we propose a novel and efficient reformulation-linearization metho...

Full description

Saved in:
Bibliographic Details
Published in2013 American Control Conference pp. 3985 - 3990
Main Authors Dajun Yue, Fengqi You
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2013
Subjects
Algorithm design and analysis
Job shop scheduling
Linear programming
Optimization methods
Processor scheduling
Programming
Online AccessGet full text

Cover

More Information
Summary:Global optimization of large-scale mixed-integer linear fractional programs (MILFPs) could be computationally intractable due to the presence of discrete variables and the pseudoconvex/pseudoconcave objective function. In this paper, we propose a novel and efficient reformulation-linearization method, which integrates the Charnes-Cooper transformation and the Glover's linearization scheme, to transform general MILFPs into their equivalent mixed-integer linear programs (MILP), allowing MILFPs to be globally optimized effectively with MILP methods. A case study on the cyclic scheduling of multipurpose batch plant is demonstrated to illustrate the efficiency of this method. Computational results show that the proposed approach requires significantly shorter CPU times than various general-purpose MINLP methods and is comparable with the tailored Dinkelbach's algorithm for solving large-scale MILFP problems.
ISBN:1479901776
9781479901777
ISSN:0743-1619
2378-5861
DOI:10.1109/ACC.2013.6580449