A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems

Rick Hesse
Additional contact information
Rick Hesse: San Diego State University, San Diego, California

Operations Research, 1973, vol. 21, issue 6, 1267-1280

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.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.6.1267 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:21:y:1973:i:6:p:1267-1280

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().