TY - JOUR
T1 - On the polynomial mixed 0-1 fractional programming problems
AU - Chang, Ching Ter
PY - 2001/5/16
Y1 - 2001/5/16
N2 - This paper proposes a new method of solving polynomial mixed 0-1 fractional programming (P01FP) problems to obtain a global optimum. Given a polynomial 0-1 term x1x2, ..., xny, where xi is a 0-1 variable and y is a continuous variable; we develop a linearization technique to transfer the x1x2, ..., xny term into a set of mixed 0-1 linear inequalities. Based on this technique, the P01FP can then be solved by a branch-and-bound method to obtain the global solution.
AB - This paper proposes a new method of solving polynomial mixed 0-1 fractional programming (P01FP) problems to obtain a global optimum. Given a polynomial 0-1 term x1x2, ..., xny, where xi is a 0-1 variable and y is a continuous variable; we develop a linearization technique to transfer the x1x2, ..., xny term into a set of mixed 0-1 linear inequalities. Based on this technique, the P01FP can then be solved by a branch-and-bound method to obtain the global solution.
UR - http://www.scopus.com/inward/record.url?scp=0035341826&partnerID=8YFLogxK
U2 - 10.1016/S0377-2217(00)00097-7
DO - 10.1016/S0377-2217(00)00097-7
M3 - 文章
AN - SCOPUS:0035341826
SN - 0377-2217
VL - 131
SP - 224
EP - 227
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 1
ER -