Abstract
This paper presents a filled function algorithm for constrained global minimization problems. The devised filled function contains only one parameter which could be adjusted easily during the iterations. The properties of the proposed filled function are discussed, and a filled function algorithm is given. At the end of the paper, a few numerical examples are included to show the effectiveness of the filled function algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have