Approximation of Weak Efficient Solutions in Vector Optimization

DOI10.1007/978-3-319-18161-5_41zbMath1370.90243OpenAlexW957889169MaRDI QIDQ5357011

Bienvenido Jiménez, Vicente Novo Sanjurjo, César Gutiérrez, Lidia Huerga

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_41

zbMATH Keywords

vector optimizationnonlinear scalarizationweak efficient solutionKuhn-Tucker optimality conditions\(\epsilon\)-efficient solution\(\epsilon\)-subgradients

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Programming in abstract spaces (90C48)

Related Items (1)

Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems

Cites Work

• Pointwise well-posedness in set optimization with cone proper sets
• Nonconvex separation theorems and some applications in vector optimization
• A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Variational methods in partially ordered spaces
• Proper approximate solutions and \(\varepsilon\)-subdifferentials in vector optimization: basic properties and limit behaviour
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation of Weak Efficient Solutions in Vector Optimization