Logarithmic E-convex multi-objective programming

DOI10.2478/CANDC-2024-0014MaRDI QIDQ7012333zbMATH OpenFDO

Authors Tarek G. Emam

Publication date 17 March 2025

Published in Control and Cybernetics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/CANDC-2024-0014

zbMATH Keywords

efficientlogarithmic \(E\)-convexitymulti-objective programmingoptimizationweak efficient

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites work

• \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
• Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong \(E\)-convexity
• Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
• Convex composite multi-objective nonsmooth programming
• Exponentially E-convex vector optimization problems
• Generalized convexity and vector optimization
• Nonlinear Programming
• Norm-based approximation in E-convex multi-objective programming
• Optimality for E-\([0,1]\) convex multi-objective programming
• Strongly E-convex sets and strongly E-convex functions
• Strongly exponentially convex functions

Cited in

(1)

• Exponentially E- 0,1 convex multi-objective programming problems

This page was built for publication: Logarithmic \(E\)-convex multi-objective programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012333)