A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems
- 1 December 1973
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 21 (6) , 1267-1280
- https://doi.org/10.1287/opre.21.6.1267
Abstract
This paper develops a penalty function and several techniques for searching nonconvex areas for a global optimum and presents numerical results for several small though very difficult nonconvex programming problems. No proofs of convergence have been obtained, nor has it been possible to categorize the types of problems for which these techniques are successful.Keywords
This publication has 0 references indexed in Scilit: