Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
From MaRDI portal
Publication:4634185
DOI10.1080/01630563.2019.1571510zbMath1485.49031OpenAlexW2912363641MaRDI QIDQ4634185
Publication date: 7 May 2019
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2019.1571510
vector optimizationseparation theoremsnearly subconvexlikenessweakly \(\varepsilon\)-efficient solution
Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for minimax problems (49K35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
- Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- On approximate efficiency in multiobjective programming
- Duality related to approximate proper solutions of vector optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Notions of relative interior in Banach spaces
- Near-subconvexlikeness in vector optimization with set-valued functions
- Proper approximate solutions and \(\varepsilon\)-subdifferentials in vector optimization: basic properties and limit behaviour
- Optimality conditions for efficient solution to the vector equilibrium problems with constraints
- Lagrangian duality for vector optimization problem with set-valued mappings
- Farkas-type results for vector-valued functions with applications
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Solution concepts in vector optimization: a fresh look at an old story
- Strong Duality in Cone Constrained Nonconvex Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Abstract convexity and global optimization
This page was built for publication: Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
