Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems.
STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH
Pagination or Media Count:
Two types of heuristic methods for solving polynomial programming PP problems were developed. The various algorithms were tested on randomly generated problems of up to 1000 variables and 200 constraints. Their performance in terms of computational time and effectiveness was investigated. The results were extremely encouraging. Optimal solutions were consistently obtained by some of the heuristic methods in over 50 of the problems solved. The effectiveness was on the average better than 99 and no less than 96.5. The computational time using the heuristic for PP problems is on the average 5 of the time required to solve the problems to optimality.
- Theoretical Mathematics