Characterizations of efficient and weakly efficient points in nonconvex vector optimization
From MaRDI portal
Publication:2018507
DOI10.1007/s10898-014-0191-1zbMath1342.90221OpenAlexW1980323035MaRDI QIDQ2018507
Publication date: 24 March 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0191-1
efficient pointweakly efficient pointnonconvex vector optimizationlinearizing coneptimality conditions
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Characterizations of improvement sets via quasi interior and applications in vector optimization, Vector-valued separation functions and constrained vector optimization problems: optimality and saddle points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- Convexificators and strong Kuhn-Tucker conditions
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Generalized convexity and vector optimization
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- On characterizing the solution sets of pseudoinvex extremum problems
- Pshenichnyi's theorem for vector minimization
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- An improved definition of proper efficiency for vector maximization with respect to cones
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Efficiency and generalized concavity
- Characterizations of efficient points in convex vector optimization problems
- A characterization of weakly efficient points
- Generalized monotonicity and convexity of non-differentiable functions
- On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
- Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
- A survey of recent developments in multiobjective optimization
- Handbook of multicriteria analysis
- On the cones of tangents with applications to mathematical programming
- Geometrical characterization of weakly efficient points
- A unified vector optimization problem: complete scalarizations and applications
- Dual Characterization and Scalarization for Benson Proper Efficiency
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- Optimization and nonsmooth analysis
- Necessary Optimality Conditions for Nonsmooth Multicriterial Optimization Problems
- Proper Efficient Points for Maximizations with Respect to Cones
- Degrees of Efficiency and Degrees of Minimality
- Multicriteria Optimization
- Nonlinear Programming
- Convex Analysis
