Abstract
In this study, we explore the theoretical features of a multiobjective interval-valued programming problem with vanishing constraints. In view of this, we have defined a multiobjective interval-valued programming problem with vanishing constraints in which the objective functions are considered to be interval-valued functions, and we define an LU-efficient solution by employing partial ordering relations. Under the assumption of generalized convexity, we investigate the optimality conditions for a (weakly) LU-efficient solution to a multiobjective interval-valued programming problem with vanishing constraints. Furthermore, we establish Wolfe and Mond-Weir duality results under appropriate convexity hypotheses. The study concludes with examples designed to validate our findings.
| Original language | English |
|---|---|
| Pages (from-to) | 354-384 |
| Number of pages | 31 |
| Journal | Iranian Journal of Numerical Analysis and Optimization |
| Volume | 13 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2023 |
Bibliographical note
Publisher Copyright:© International Scientific Organization.
Keywords
- (weakly) LU-efficient solution
- Multiobjective interval-valued optimization problem
- duality
- vanishing constraints
ASJC Scopus subject areas
- Numerical Analysis
- Modeling and Simulation
- Control and Optimization
- Computational Mathematics
Fingerprint
Dive into the research topics of 'On optimality and duality for multiobjective interval-valued programming problems with vanishing constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver