On optimality conditions for quasi-relative efficient solutions in set-valued optimization

DOI10.1007/s11750-015-0399-3zbMath1336.90103OpenAlexW1747272963MaRDI QIDQ286212

Nguyen Le Hoang Anh

Publication date: 20 May 2016

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-015-0399-3

zbMATH Keywords

saddle-pointoptimality conditionset-valued optimizationquasi-relative efficient solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Set-valued maps in general topology (54C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
• Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization
• Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
• Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Higher order optimality conditions for Henig efficient solutions in set-valued optimization
• On programming when the positive cone has an empty interior
• Optimality conditions for weak and firm efficiency in set-valued optimization
• Higher-order optimality conditions for set-valued optimization
• Revisiting some duality theorems via the quasirelative interior in convex optimization
• Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Partially finite convex programming. II: Explicit lattice models
• Generalizations of Slater's constraint qualification for infinite convex programs
• Optimality conditions for proper efficient solutions of vector set-valued optimization.
• Separation theorem based on the quasirelative interior and application to duality theory
• Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
• Higher-order optimality conditions in set-valued optimization using radial sets and radial derivatives
• Infinite dimensional duality and applications
• Extended Pareto Optimality in Multiobjective Problems
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• A comparison of constraint qualifications in infinite-dimensional convex programming revisited
• GENERALIZED CONTINGENT EPIDERIVATIVES IN SET-VALUED OPTIMIZATION: OPTIMALITY CONDITIONS
• Second-Order Modified Contingent Epiderivatives in Set-Valued Optimization
• Optimality conditions for maximizations of set-valued functions

This page was built for publication: On optimality conditions for quasi-relative efficient solutions in set-valued optimization