MAPLE code of the cubic algorithm for multiobjective optimization with box constraints
From MaRDI portal
(Redirected from Publication:363523)
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
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
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)