Unified duality for mathematical programming problems with vanishing constraints
نویسندگان
1 Department of Mathematics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia
2 Center for Intelligent Secure Systems, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia
3 Department of Mathematics, School of Science, GITAM-Hyderabad Campus Hyderabad-502329, India
doi
10.22075/ijnaa.2022.25816.3134چکیده
In this article, we formulate a new mixed-type dual problem for a mathematical program with vanishing constraints. The presented dual problem does not involve the index set, however, the dual models contain the calculations of index sets, which makes it difficult to solve these models from an algorithm point of view. The weak, strong and strict converse duality theorems are discussed in order to establish the relationships between the mathematical program with vanishing constraints and its mixed type dual under generalized convexity. To validate the results, a non-trivial example is discussed. Our dual model unifies the dual models discussed in [Q. Hu, J. Wang, Y. Chen, New dualities for mathematical programs with vanishing constraints, Annals of Operations Research, 287 (2020) 233-255].
