TY - JOUR
T1 - Global optimization for mixed 0-1 programs with convex or separable continuous functions
AU - Li, Han-Lin
PY - 1994/9
Y1 - 1994/9
N2 - This paper proposes a global approach for solving mixed 0-1 programming problems containing convex or separable continuous functions. Given a mixed 0-1 polynomial term z = x1, x2… xng(Y) where x1, x2. xn are 0-1 integer variables and g(T) is a convex or a separable continuous function, we can transform z into a set of inequalities where x1, x2, …., xn and g(Y) are separated from each other. Based on this transformation, the original mixed 0-1 program can then be solved by a branch-and-bound method to obtain a global optimum.
AB - This paper proposes a global approach for solving mixed 0-1 programming problems containing convex or separable continuous functions. Given a mixed 0-1 polynomial term z = x1, x2… xng(Y) where x1, x2. xn are 0-1 integer variables and g(T) is a convex or a separable continuous function, we can transform z into a set of inequalities where x1, x2, …., xn and g(Y) are separated from each other. Based on this transformation, the original mixed 0-1 program can then be solved by a branch-and-bound method to obtain a global optimum.
KW - Branch-and-bound
KW - Mixed 0-1 programs
KW - Separable programs
UR - http://www.scopus.com/inward/record.url?scp=0028497909&partnerID=8YFLogxK
U2 - 10.1057/jors.1994.172
DO - 10.1057/jors.1994.172
M3 - Article
AN - SCOPUS:0028497909
SN - 0160-5682
VL - 45
SP - 1068
EP - 1076
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
IS - 9
ER -