A linearization method for mixed 0-1 polynomial programs

Computers and Operations Research

Volumn 27, Issue 10, 2000, Pages 1005-1016

  Chang, Ching Ter ^a   Chang, Chi Chiao ^b  

^a NATIONAL CHANGHUA UNIVERSITY OF EDUCATION   (Taiwan)

^b Azu Clinic for Animals   (Taiwan)

Author keywords

Linearization; Mixed 0 1; Polynomial

Indexed keywords

CONSTRAINT THEORY; ITERATIVE METHODS; LINEARIZATION; MATHEMATICAL PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING;

BRANCH-AND-BOUND METHOD;

OPERATIONS RESEARCH;

ALGORITHM; METHODOLOGY;

EID: 0034128286     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00071-4     Document Type: Article

References (20)

1. Dantzig GB. Linear programming and extensions. Princeton: Princeton University Press, 1962.
2. Zangwill W.I. Media selection by decision programming. Journal of Advertising Research. 5(3):1965;30-36.
3. Water L.J. Reduction of integer polynomial programming problems to zero-one linear programming problems. Operations Research. 15:1967;1171-1174.
4. Glover F., Woolsey E. Converting the 0-1 polynomial programming problem to a 0-1 Linear Program. Operations Research. 22:1974;180-182.
5. Glover F. Improved linear integer programming formulations of nonlinear integer problems. Management Science. 22(4):1975;455-460.
6. Adams W.P., Sherali H.D. Linearization strategies for a class of zero-one mixed integer programming problems. Operations Research. 38:1990;217-226.
7. Sherali H.D., Tuncbilek C.H. A global optimization algorithm for polymomial programming problems using a reformulation-linearization technique. Journal of Global Optimization. 2:1992;101-112.
8. Sherali H.D., Adams W.P., Driscoll P.J. Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Operations Research. 46(3):1998;396-405.
9. Shin D.K., Gurdal Z., Griffin O. A penalty approach for nonlinear optimization with discrete design variables. Engineering Optimization. 16:1990;19-42.
10. Li H.L. An approximate method for local optima for solving nonlinear integer programming. Computers & Operations Research. 19:1992;435-444.
11. Li H.L., Chang C.T. An approximate approach of global optimization for polynomial programming problems. European Journal of Operational Research. 107(3):1998;625-632.
12. Oral M., Kettani O. A linearization procedure for quadratic and cubic mixed-integer problems. Operations Research. 40(1):1992;109-116.
13. Løkketangen A., Glover F. Tabu search for zero/one mixed integer programming with advanced level strategies and learning. International Journal of Operations and Quantitative Management. 1(2):1995;89-108.
14. Løkketangen A., Glover F. Solving zero-one mixed integer programming problems using tabu search. European Journal of Operational Research. 106:1998;624-658.
15. Van Roy T.J., Wolsey L.A. Solving mixed integer programming problems using automatic reformulation. Operations Research. 35:1987;45-57.
16. Padberg M., Rinaldi G. A branch-and-cut algorithm for resolution of large-scale symmetric traveling salesman problems. SIAM Review. 33:1991;66-100.
17. Balas E., Ceria S., Cornuèjols G. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science. 42(9):1996;1229-1246.
18. Bienstock D. Computational study of a family of mixed-integer quadratic programming problems. Mathematical programming. 74:1996;121-140.
19. Li H.L. Global optimization for mixed 0-1 programs with convex or separable continuous functions. Journal of the Operational Research Society. 45(9):1994;1068-1076.
20. Schrage L., LINDO Release 5.3, LINDO System, Inc., 1994.