Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
From MaRDI portal
Publication:1298722
DOI10.1007/s001860050026zbMath0930.90078OpenAlexW2077744102MaRDI QIDQ1298722
Publication date: 22 August 1999
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860050026
Lagrange multipliersvector optimizationset-valued mapssuper dualitysuper efficiencycone-convexlikeness
Related Items
A kind of unified super efficiency via assumption (A) and applications in vector optimization ⋮ Proximal Proper Saddle Points in Set-Valued Optimization ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions ⋮ \(E\)-super efficiency of set-valued optimization problems involving improvement sets ⋮ Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Strong duality with super efficiency in set-valued optimization ⋮ Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces ⋮ The Lagrange multiplier rule for super efficiency in vector optimization ⋮ Optimality conditions of vector set-valued optimization problem involving relative interior ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ Optimality conditions for strictly efficient solutions in set-valued optimization ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ Image space analysis and scalarization of multivalued optimization ⋮ Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions ⋮ Super efficient solutions for set-valued maps ⋮ Characterizations of Hartley proper efficiency in nonconvex vector optimization ⋮ Super efficiency in vector optimization with nearly convexlike set-valued maps.
