Generalized Invexity and Mathematical Programs
GENERALIZED CONVEXITY AND MATHEMATICAL PROGRAMS
Abstract
In this paper, using generalized convexity assumptions we show that Mstationary condition is sufficient for global or local optimality under some mathematical programming problem with equilibrium constraints(MPEC). Further, we formulate and study, Wolfe type and Mond-Weir type dual models for the MPEC and establish weak and strong duality theorems.
Published
Dec 22, 2020
How to Cite
JOSHI, Bhuwan Chandra; MOHAN, Rakesh; PANKAJ, Pankaj.
Generalized Invexity and Mathematical Programs.
Yugoslav Journal of Operations Research, [S.l.], v. 31, n. 4, p. 455-469, dec. 2020.
ISSN 2334-6043.
Available at: <http://yujor.fon.bg.ac.rs/index.php/yujor/article/view/877>. Date accessed: 28 mar. 2024.
Issue
Section
Articles
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.