Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function
DOI10.3934/jimo.2019089zbMath1476.90295OpenAlexW2964305575MaRDI QIDQ2244252
Tadeusz Antczak, Najeeb Abdulaleem
Publication date: 12 November 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2019089
\(E\)-convex function\(E\)-differentiable function\(E\)-differentiable vector optimization problem with multiple interval-valued objective function\(E\)-Karush-Kuhn-Tucker necessary optimality conditions
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (3)
Cites Work
- Optimality and mixed duality in multiobjective \(E\)-convex programming
- On interval-valued invex mappings and optimality conditions for interval-valued optimization problems
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Univex interval-valued mapping with differentiability and its application in nonlinear programming
- On sufficiency and duality for a class of interval-valued programming problems
- An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming
- Some properties of \(E\)-convex functions
- Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions
- Multiobjective programming in optimization of interval objective functions -- a generalized approach
- On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
- Some properties of semi-\(E\)-convex functions.
- Optimality criteria in \(E\)-convex programming
- Efficient solution of interval optimization problem
- On the \(E\)-epigraph of an \(E\)-convex function
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- On interval-valued optimization problems with generalized invex functions
- The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function
- On interval-valued nonlinear programming problems
- Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function
- E-convexity and its generalizations
- Optimality Condition and Mixed Duality for Interval-Valued Optimization
- Optimality conditions for invex interval valued nonlinear programming problems involving generalized H-derivative
- On \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function