MAPLE code of the cubic algorithm for multiobjective optimization with box constraints

DOI10.3934/NACO.2013.3.407zbMATH Open1276.90049OpenAlexW1989175056MaRDI QIDQ363523FDOQ363523

Authors: M. Delgado Pineda, E. A. Galperin, P. Jiménez Guerra 

Publication date: 3 September 2013

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2013.3.407

Recommendations

• Global optimization in \(\mathbb R^{n}\) with box constraints and applications: a MAPLE code
• Non-convex global optimization by the beta algorithm: a MAPLE code
• Global optimization over general compact sets by the beta algorithm: a MAPLE code
• Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
• The cubic algorithm for global optimization with box and equality constraints and application to the optimal allocation of resources

zbMATH Keywords

multiobjective optimizationPareto solutionsnondifferentiable optimizationcubic algorithmset contraction algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Multiobjective variational problems, Pareto optimality, applications to economics, etc. (58E17)

Cited In (4)

• The cubic algorithm for global optimization with box and equality constraints and application to the optimal allocation of resources
• Global optimization over general compact sets by the beta algorithm: a MAPLE code
• Global optimization in \(\mathbb R^{n}\) with box constraints and applications: a MAPLE code
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions

Uses Software

• Maple

This page was built for publication: MAPLE code of the cubic algorithm for multiobjective optimization with box constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363523)