Optimality for E-[0,1] convex multi-objective programming

DOI10.2298/FIL1703529EzbMath1488.90169OpenAlexW2743706103MaRDI QIDQ5005848

Tarek G. Emam

Publication date: 11 August 2021

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1703529e

zbMATH Keywords

optimal solutionsproperly efficient solutionsmulti-objective problemsE-\([0,1\) convex functions]

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roughly \(B\)-invex programming problems
• Generalized convexity and vector optimization.
• Optimality criteria in nonlinear programming involving nonconvex functions
• Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong \(E\)-convexity
• Generalised convexity and duality in multiple objective programming
• Generalization of some duality theorems in nonlinear programming

This page was built for publication: Optimality for E-[0,1] convex multi-objective programming