444. A new F-E-objective approach and optimality conditions for E-differentiable interval-valued multiobjective optimization problems
Invited abstract in session TD-51: Advances in nonlinear multiobjective optimization, stream Multiobjective and vector optimization.
Tuesday, 14:30-16:00Room: Parkinson B22
Authors (first author is the speaker)
| 1. | Najeeb Abdulaleem
|
| Faculty of Mathematics and Computer Science, University of Warmia and Mazury in Olsztyn |
Abstract
The increasing reliance on optimization models for decision making has created a demand for tools that can formulate and solve a broader range of models related to real-world processes and human activities, especially in situations where hypotheses cannot be verified in the traditional sense of classical optimization. One effective approach to addressing real-world extremum problems under uncertainty is interval-valued optimization.
In this paper, a nonconvex E-differentiable vector optimization problem with multiple interval-valued objective functions and both inequality and equality constraints is considered. We derive the E-Karush-Kuhn-Tucker (E-KKT) necessary optimality conditions for these interval-valued multiobjective programming problems. Further, we propose a new methodology termed the F-E-objective function approach. This method transforms the original vector optimization problem into an equivalent vector optimization problem with interval-valued F-E-objective functions, ensuring equivalence under F-E-convexity assumptions. The proposed approach is demonstrated to be effective in solving nonlinear, nonconvex interval-valued optimization problems. Furthermore, we illustrate that, under specific conditions, the introduced method enables the resolution of complex nonlinear problems by leveraging techniques designed for linear interval-valued optimization.
Keywords
- Generalized Convex Optimization
- Mathematical Programming
- Programming, Nonlinear
Status: accepted
Back to the list of papers