Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
From MaRDI portal
Publication:2905370
DOI10.1007/978-3-642-21114-0_8zbMath1247.90238OpenAlexW44597993MaRDI QIDQ2905370
No author found.
Publication date: 27 August 2012
Published in: Vector Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21114-0_8
Related Items (9)
Farkas-type results for vector-valued functions with applications ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Approximate solutions of interval-valued optimization problems ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
This page was built for publication: Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
