Abstract
In this paper, we are concerned with one of the dificult class of optimization problems called the interval-valued optimization problem with vanishing constraints. Sufficient optimality conditions for a LU optimal solution are derived under generalized convexity assumptions. Moreover, appropriate duality results are discussed for a Mond-Weir type dual problem. In addition, numerical examples are given to support the sufficient optimality conditions and weak duality theorem.
| Original language | English |
|---|---|
| Pages (from-to) | 784-798 |
| Number of pages | 15 |
| Journal | International Journal of Analysis and Applications |
| Volume | 18 |
| Issue number | 5 |
| DOIs | |
| State | Published - 2020 |
Bibliographical note
Publisher Copyright:© 2020 Authors retain the copyrights.
Keywords
- constraint qualifications
- duality
- generalized convexity
- interval-valued optimization problem
- sufficiency
- vanishing constraints
ASJC Scopus subject areas
- Analysis
- Business and International Management
- Geometry and Topology
- Applied Mathematics
Fingerprint
Dive into the research topics of 'SUFFICIENCY AND DUALITY FOR INTERVAL-VALUED OPTIMIZATION PROBLEMS WITH VANISHING CONSTRAINTS USING WEAK CONSTRAINT QUALIFICATIONS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver