Efficient linearization approach for mixed-integer problems

European Journal of Operational Research

Volumn 123, Issue 3, 2000, Pages 652-659

  Chang, Ching Ter ^a  

^a NATIONAL CHANGHUA UNIVERSITY OF EDUCATION   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; LINEARIZATION; MANAGEMENT SCIENCE; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

MIXED-INTEGER PROBLEMS;

OPERATIONS RESEARCH;

EID: 0033747468     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00106-X     Document Type: Article

References (14)

1. G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1962.
2. Glover F., Woolsey E. Converting the 0-1 polynomial programming problem to a 0-1 linear program. Operations Research. 22:1974;180-182.
3. Glover F. Improved linear integer programming formulations of nonlinear integer problems. Management Science. 2:1975;455-460.
4. Glover F. An improved MIP formulation for products of discrete and continuous variables. Journal of Information and Optimization Sciences. 5:1984;69-71.
5. Kettani O., Oral M. Equivalent formulations of nonlinear integer problems for efficient optimization. Management Science. 36:1990;115-119.
6. Li H.L., Chang C.T. An approximate approach of global optimization for polynomial programming problems. European Journal of Operational Research. 107:1998;625-632.
7. 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:1995;89-108.
8. Løkketangen A., Glover F. Solving zero-one mixed integer programming problems using tabu search. European Journal of Operational Research. 106:1998;624-658.
9. L. Schrage, LINDO Release 5.3, LINDO System, Inc., 1994.
10. Oral M., Kettani O. A Linearization procedure for quadratic and cubic mixed-integer problem. Operations Research. 40:1992;109-116.
11. Sherali H.D., Tuncbilek C.H. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization. 2:1992;101-112.
12. 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:1998;396-405.
13. Water L.J. Reduction of integer polynomial programming problems to zero-one linear programming problems. Operations Research. 15:1967;1171-1174.
14. Zangwill W.I. Media selection by decision programming. Journal of Advertising Research. 5:1965;30-36.