Abstract
This article presents a range division and contraction algorithm for a class of global optimization problems. In the algorithm, the original problem is first converted into an equivalent monotonic optimization problem whose objective function is just a simple univariate. By exploiting the particularity of this monotonicity, the variable bound in a particular node is then tightened and the bounds on the constraints are calculated to remove the region which doesn’t contain optimal solutions. The proposed method can reach an approximate solution within an acceptable error, in which such solution is adequately guaranteed to be feasible and to be close to the actual global optimal solution. Several numerical examples are given to illustrate the feasibility and efficiency of the present algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
