Optimality conditions of multiobjective programming problems based on weak convexity
From MaRDI portal
Publication:3306593
Recommendations
- Multiobjective programming problems under generalized convexity
- scientific article; zbMATH DE number 179184
- Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
- Optimality for E-\([0,1]\) convex multi-objective programming
- Sufficient global optimality conditions for weakly convex minimization problems
Cited in
(12)- Necessary conditions for suboptimization over the weakly efficient set associated to generalized invex multiobjective programming
- Sufficient global optimality conditions for weakly convex minimization problems
- Sufficient conditions for global weak Pareto solutions in multiobjective optimization
- Some relations among absolutely optimal solutions, effective solutions and weakly effective solutions for multiobjective programming problem
- scientific article; zbMATH DE number 5951407 (Why is no real title available?)
- scientific article; zbMATH DE number 2107635 (Why is no real title available?)
- Integral global optimality conditions and an algorithm for multiobjective problems
- Generalized polarity and weakest constraint qualifications in multiobjective optimization
- Weak efficiency in multiobjective variational problems under generalized convexity
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
- On the set of weakly efficient minimizers for convex multiobjective programming
This page was built for publication: Optimality conditions of multiobjective programming problems based on weak convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3306593)
