MAPLE CODE OF THE CUBIC ALGORITHM FOR MULTIOBJECTIVE OPTIMIZATION WITH BOX CONSTRAINTS

A generalization of the cubic algorithm is presented for global optimization of nonconvex nonsmooth multiobjective optimization programs min f(s) (x), s = 1,..., k, with box constraints x is an element of X = [a(1), b(1)]x ... x[a(n), b(n)]. This monotonic set contraction algorithm converges onto the entire exact Pareto set, if nonempty, and yields its approximation with given precision in a finite number of iterations. Simultaneously, approximations for the ideal point and for the function values over Pareto set are obtained. The method is implemented by Maple code, and this code does not create ill-conditioned situations. Results of numerical experiments are presented, with graphs, to illustrate the use of the code, and the solution set can be visualized in projections on coordinate planes. The code is ready for engineering and economic applications.