TY - JOUR
T1 - A global approach for general 0-1 fractional programming
AU - Li, Han-Lin
PY - 1994/3/24
Y1 - 1994/3/24
N2 - Current methods of general 0-1 fractional programming (G-FP) can only find the local optimum. This paper proposes a new method of solving G-FP problems by a mixed 0-1 linear program to obtain a global optimum. Given a mixed 0-1 polynomial term xy where x is a 0-1 variable and 0 < y ≤ 1, we develop a theorem to transfer the xy term into a set of mixed 0-1 linear inequalities. Based on this theorem, a G-FP problem can be solved by a branch-and-bound method to obtain the global solution.
AB - Current methods of general 0-1 fractional programming (G-FP) can only find the local optimum. This paper proposes a new method of solving G-FP problems by a mixed 0-1 linear program to obtain a global optimum. Given a mixed 0-1 polynomial term xy where x is a 0-1 variable and 0 < y ≤ 1, we develop a theorem to transfer the xy term into a set of mixed 0-1 linear inequalities. Based on this theorem, a G-FP problem can be solved by a branch-and-bound method to obtain the global solution.
KW - 0-1 fractional programming
KW - Branch-and-bound method
UR - http://www.scopus.com/inward/record.url?scp=0028396190&partnerID=8YFLogxK
U2 - 10.1016/0377-2217(94)90257-7
DO - 10.1016/0377-2217(94)90257-7
M3 - Article
AN - SCOPUS:0028396190
SN - 0377-2217
VL - 73
SP - 590
EP - 596
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 3
ER -