Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong \(E\)-convexity

DOI10.1016/S0252-9602(08)60002-8zbMath1150.90012OpenAlexW2067139336MaRDI QIDQ933102

B. E. Eshmatov

Publication date: 6 August 2008

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(08)60002-8

zbMATH Keywords

efficient solutionsproperly efficient solutionsmulti-objective optimization problemssemi-strong \(E\)-convex

Mathematics Subject Classification ID

Semidefinite programming (90C22) Multi-objective and goal programming (90C29)

Related Items (6)

Optimality for \(E\text{-}[0,1\) convex multi-objective programming problems] ⋮ Norm-based approximation in \(E\)-\([0,1\) convex multi-objective programming] ⋮ Optimality of \(E\)-pseudoconvex multi-objective programming problems without constraint qualifications ⋮ \(V-E\)-invexity in \(E\)-differentiable multiobjective programming ⋮ Optimality for E-[0,1 convex multi-objective programming] ⋮ On geodesic strongly \(E\)-convex sets and geodesic strongly \(E\)-convex functions

This page was built for publication: Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong \(E\)-convexity