An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs

The purpose of this note is to present an accelerated algorithm for solving 0–1 positive polynomial (PP) problems. Like our covering relaxation algorithm (Management Science 1979), the accelerated algorithm is a cutting plane method, which uses the linear set covering problem as a relaxation for PP. However, a unique and novel feature of the accelerated algorithm is that it attempts to generate cutting planes from heuristic solutions to the set covering problem whenever possible. Computational results reveal that this strategy of generating cutting planes has led to a significant reduction in the computational time required to solve a PP problem.

[1]  Willard I. Zangwill,et al.  Media Selection by Decision Programming , 1976 .

[2]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[3]  Nicos Christofides,et al.  Note—A Computational Survey of Methods for the Set Covering Problem , 1975 .

[4]  Daniel Granot,et al.  Covering Relaxation for Positive 0-1 Polynomial Programs , 1979 .

[5]  Willem Vaessen.  Covering relaxation methods for solving the zero-one positive polynomial programming problem , 1981 .

[6]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[7]  Frieda Granot,et al.  Note-Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems , 1982 .

[8]  Javier Etcheberry,et al.  The Set-Covering Problem: A New Implicit Enumeration Algorithm , 1977, Oper. Res..

[9]  Hamdy A. Taha,et al.  A Balasian-Based Algorithm for Zero-One Polynomial Programming , 1972 .

[10]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[11]  S. Senju,et al.  An Approach to Linear Programming with 0--1 Variables , 1968 .

[12]  Frederick S. Hillier,et al.  Interior Path Methods for Heuristic Integer Programming Procedures , 1979, Oper. Res..

[13]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

[14]  M. Rao.  Cluster Analysis and Mathematical Programming , 1971 .

[15]  Dan J. Laughhunn,et al.  Capital Expenditure Programming and Some Alternative Approaches to Risk , 1971 .

[16]  Hamdy A. Taha.  Further Improvements in the Polynomial Zero-One Algorithm , 1972 .