On generalized-convex constrained multi-objective optimization
From MaRDI portal
Convex programming (90C25) Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Convexity of real functions of several variables, generalizations (26B25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Recommendations
- Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints
- Vectorial penalization in multi-objective optimization
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- Generalized convexity in multiobjective programming
- On the structure of the weakly efficient set for quasiconvex vector minimization
Cited in
(8)- Vectorial penalization in multi-objective optimization
- On generalized trade-off directions in nonconvex multiobjective optimization
- Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- A complementarity constraint formulation of convex multiobjective optimization problems
- A new concept of semistrict quasiconvexity for vector functions
- Vectorial penalisation in vector optimisation in real linear-topological spaces
- Pareto efficient solutions in multi-objective optimization involving forbidden regions
This page was built for publication: On generalized-convex constrained multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146238)
