Characterizations of the \(E\)-Benson proper efficiency in vector optimization problems

DOI10.3934/NACO.2013.3.643zbMath1275.49061OpenAlexW1964125758MaRDI QIDQ380346

Ke Quan Zhao, Yang, Xinmin

Publication date: 13 November 2013

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2013.3.643

zbMATH Keywords

Lagrange multipliersvector optimizationdualityscalarization\(E\)-Benson proper efficiencynearly \(E\)-subconvexlikenesssaddle point criteria

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (6)

A kind of unified super efficiency via assumption (A) and applications in vector optimization ⋮ A kind of unified strict efficiency via improvement sets in vector optimization ⋮ \(E\)-super efficiency of set-valued optimization problems involving improvement sets ⋮ Conic scalarizations for approximate efficient solutions in nonconvex vector optimization problems ⋮ Approximate solutions of vector optimization problems via improvement sets in real linear spaces ⋮ The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets

This page was built for publication: Characterizations of the \(E\)-Benson proper efficiency in vector optimization problems