Article
Version 1
Preserved in Portico This version is not peer-reviewed
On Approximate Variational Inequalities and Bilevel Programming Problems
Version 1
: Received: 2 April 2024 / Approved: 7 April 2024 / Online: 8 April 2024 (16:35:51 CEST)
A peer-reviewed article of this Preprint also exists.
Upadhyay, B.B.; Stancu-Minasian, I.; Poddar, S.; Mishra, P. On Approximate Variational Inequalities and Bilevel Programming Problems. Axioms 2024, 13, 371. Upadhyay, B.B.; Stancu-Minasian, I.; Poddar, S.; Mishra, P. On Approximate Variational Inequalities and Bilevel Programming Problems. Axioms 2024, 13, 371.
Abstract
In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.
Keywords
limiting subdifferentials; ϵ-quasi solutions; approximate convex functions; variational inequalities
Subject
Computer Science and Mathematics, Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment