Characterizations of efficient and weakly efficient points in nonconvex vector optimization
From MaRDI portal
The authors derive a necessary and sufficient condition for weak efficiency and a sufficient criteria for efficiency of nonconvex nonsmooth vector optimization problems involving inequality constraints and a closed convex set constraint with C(T)-valued mappings in terms of the Clarke subdifferentials under suitable generalized convexity together with some special cases.
Recommendations
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- Characterizations of efficient points in convex vector optimization problems
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- On the existence of weak efficient solutions of nonconvex vector optimization problems
- On the properly efficient points of nonconvex sets
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
- A characterization of weakly \((C, \varepsilon)\)-efficient solution of vector optimization via nonlinear scalarization
- Algebraic characterizations of weakly E-efficient solutions for vector optimization problems
Cites work
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- A characterization of weakly efficient points
- A survey of recent developments in multiobjective optimization
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- A unified vector optimization problem: complete scalarizations and applications
- An improved definition of proper efficiency for vector maximization with respect to cones
- Characterizations of efficient points in convex vector optimization problems
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Convex Analysis
- Convexificators and strong Kuhn-Tucker conditions
- Degrees of Efficiency and Degrees of Minimality
- Dual Characterization and Scalarization for Benson Proper Efficiency
- Efficiency and generalized concavity
- Generalized convexity and vector optimization
- Generalized monotonicity and convexity of non-differentiable functions
- Geometrical characterization of weakly efficient points
- Handbook of multicriteria analysis
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 824551 (Why is no real title available?)
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Multicriteria Optimization
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- Necessary Optimality Conditions for Nonsmooth Multicriterial Optimization Problems
- Nonlinear Programming
- On characterizing the solution sets of pseudoinvex extremum problems
- On the cones of tangents with applications to mathematical programming
- On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
- Optimization and nonsmooth analysis
- Proper Efficient Points for Maximizations with Respect to Cones
- Pshenichnyi's theorem for vector minimization
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
Cited in
(10)- Efficient and weak efficient points in vector optimization with generalized cone convexity
- Characterizations of efficiency in vector optimization with \(\mathcal C(T)\)-valued mappings
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Characterizations of improvement sets via quasi interior and applications in vector optimization
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
- Characterization of weakly efficient points
- scientific article; zbMATH DE number 2070520 (Why is no real title available?)
- Vector-valued separation functions and constrained vector optimization problems: optimality and saddle points
- On the characterization of efficient production vectors
This page was built for publication: Characterizations of efficient and weakly efficient points in nonconvex vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018507)
