Non-convex global optimization by the beta algorithm: A MAPLE code

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. (C) 2005 Published by Elsevier Ltd.