Approximate solutions of vector optimization problems via improvement sets in real linear spaces

DOI10.1007/s10898-017-0593-yzbMath1441.90145OpenAlexW2775168441MaRDI QIDQ1753139

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

Publication date: 25 May 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0593-y

zbMATH Keywords

Lagrange multipliersvector optimizationimprovement setnearly \(E\)-subconvexlikenesslinear scalarizationalgebraic interiorvector closureapproximate proper efficiencyapproximate weak efficiency

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Optimality conditions for problems in abstract spaces (49K27)

Related Items

Levitin-Polyak well-posedness for vector optimization problems in linear spaces, Density and connectedness of optimal points with respect to improvement sets, Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization, Further results on quasi efficient solutions in multiobjective optimization, Optimality Conditions for Approximate Pareto Minimality, Stability of optimal points with respect to improvement sets, Set relations and weak minimal solutions for nonconvex set optimization problems with applications, Unifying local-global type properties in vector optimization, Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis, Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of improvement sets via quasi interior and applications in vector optimization
• Weak \(E\)-optimal solution in vector optimization
• Characterizations of the \(E\)-Benson proper efficiency in vector optimization problems
• Stability and scalarization in vector optimization using improvement sets
• Vector optimization problems via improvement sets
• Proper efficiency in vector optimization on real linear spaces.
• \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces
• Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
• Étude geométrique des espaces vectoriels. Une introduction
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
• Proper approximate solutions and \(\varepsilon\)-subdifferentials in vector optimization: basic properties and limit behaviour
• Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
• Improvement sets and vector optimization
• \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
• \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
• Vector Optimization
• Set-valued Optimization