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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
