On the polynomial mixed 0-1 fractional programming problems

被引:26
作者
Chang, CT [1 ]
机构
[1] Natl Changhua Univ Educ, Dept Informat Management, Changhua 50058, Taiwan
关键词
fractional programming; linearization; mixed 0-1 fractional programming;
D O I
10.1016/S0377-2217(00)00097-7
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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 x(1)x(2),...,x(n)y, where x(i) is a 0-1 variable and y is a continuous variable; we develop a linearization technique to transfer the x(1)x(2),...,x(n)y 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. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:224 / 227
页数:4
相关论文
共 12 条
[1]  
Anzai Y, 1985, J OPERATIONS RES SOC, V17, P835
[2]   A BRANCH AND BOUND METHOD FOR INTEGER NON-LINEAR FRACTIONAL PROGRAMS [J].
CHANDRA, S ;
CHANDRAMOHAN, M .
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1980, 60 (12) :735-737
[3]   An efficient linearization approach for mixed-integer problems [J].
Chang, CT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (03) :652-659
[4]  
Charnes A., 1962, Naval Res Logist Quart, V9, P181, DOI [10.1002/nav.3800090303, DOI 10.1002/NAV.3800090303]
[6]  
Isbell J., 1956, NAV RES LOG, V3, P71, DOI DOI 10.1002/(ISSN)1931-9193
[7]   A GLOBAL APPROACH FOR GENERAL 0-1 FRACTIONAL-PROGRAMMING [J].
LI, HL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 73 (03) :590-596
[8]   (0,1) HYPERBOLIC PROGRAMMING PROBLEMS [J].
ROBILLARD, P .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (01) :47-+
[9]  
SCHRAGE L, 1994, LINDO RELEASE 5 3
[10]  
Stancu-Minasian I.M., 1997, Fractional Programming: Theory, Methods and Applications