Abstract
A variant of the beta algorithm based on cubic algorithm (Math. Comput. Modelling 38 (2003) 77–97) is presented for global optimization of continuous functions over general compact robust sets. This is a set-monotonic algorithm over non-convex, disconnected set not satisfying any qualification constraint other than being compact and robust. On this basis, a MAPLE code is developed for full global optimization of functions of n variables. The code does not create ill-conditioned situations. Graphics are included, and the solution set can be visualized in projections on coordinate planes. The code is ready for engineering applications. Results of numerical experiments are presented, with graphs, to illustrate the use of the code.
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.
