APPROXIMATE OPTIMALITY CONDITIONS AND MOND-WEIR TYPE DUALITIES FOR QUASICONVEX PROGRAMMING IN TERMS OF THE SLATER CONSTRAINT QUALIFICATION
Journal of Nonlinear and Convex Analysis, vol.26, no.1, pp.27-38, 2025 (SCI-Expanded, Scopus)
- Publication Type: Article / Article
- Volume: 26 Issue: 1
- Publication Date: 2025
- Journal Name: Journal of Nonlinear and Convex Analysis
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, MathSciNet, zbMATH
- Page Numbers: pp.27-38
- Keywords: Approximate optimality condition, Mond-Weir type duality, quasiconvex programming, Slater constraint qualification
- Open Archive Collection: Article
- Azerbaijan State University of Economics (UNEC) Affiliated: Yes
Abstract
This paper is devoted to the study of the approximate optimality conditions and Mond-Weir type dualities for quasiconvex programming problem with objective and constraint functions being quasiconvex functions. By introducing the Slater constraint qualification, necessary and sufficient approximate optimality conditions for the quasiconvex programming problem are given. Moreover, the approximate weak, strong and converse dualities between the quasiconvex programming problem and its Mond-Weir type dual problem are also given.