پیوندهای مفید
آمار
| تعداد نشریات | 21 |
| تعداد شماره‌ها | 628 |
| تعداد مقالات | 9,179 |
| تعداد مشاهده مقاله | 67,527,470 |
| تعداد دریافت فایل اصل مقاله | 8,062,118 |
Unified duality for mathematical programming problems with vanishing constraints | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 256، دوره 13، شماره 2، مهر 2022، صفحه 3191-3201 اصل مقاله (391.04 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2022.25816.3134 | ||
| نویسندگان | ||
| Izhar Ahmad* 1، 2؛ Krishna Kummari3؛ S Al-Homidan1، 4 | ||
| 1Department of Mathematics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia | ||
| 2Center for Intelligent Secure Systems, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia | ||
| 3Department of Mathematics, School of Science, GITAM-Hyderabad Campus Hyderabad-502329, India | ||
| 4Center for Smart Mobility and Logistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia | ||
| تاریخ دریافت: 16 دی 1400، تاریخ بازنگری: 30 تیر 1401، تاریخ پذیرش: 16 مرداد 1401 | ||
| چکیده | ||
| 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]. | ||
| کلیدواژه‌ها | ||
| Mathematical programming problem؛ vanishing constraints؛ constraint qualifications؛ duality | ||
| مراجع | ||
|
[1] W. Achtziger and C. Kanzow, Mathematical programs with vanishing constraints: Optimality conditions and constraint qualifications, Math. Program. 114 (2008), 69–99. [2] I. Ahmad, K. Kummari and S. Al-Homidan, Sufficiency and duality for interval-valued optimization problems with vanishing constraints using weak constraint qualification, Int. J. Anal. Appl. 18 (2020), no. 5, 784–798. [3] T. Antczak, Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints, 4OR 20 (2022), no. 3, 417–442. [4] A.A. Ardali, M. Zeinali and G.H. Shirdel, Some Pareto optimality results for nonsmooth multiobjective optimization problems with equilibrium constraints, Int. J. Nonlinear Anal. Appl. 13 (2022), no. 2, 2185–2196. [5] M.S. Bazaraa, H.D. Sherali and C. M. Shetty, Nonlinear Programming. Theory and Algorithms, 2nd edition, John Wiley & Sons, Hoboken, 1993. [6] M.P. Bendsøe and O. Sigmund, Topology Optimization-Theory, Methods and Applications, 2nd ed., Springer, Heidelberg, Germany, 2003. [7] R. Dubey and V.N. Mishra, Second-order nondifferentiable multiobjective mixed type fractional programming problems, Int. J. Nonlinear Anal. Appl. 11 (2020), no. 1, 439–451. [8] J.-P. Dussault, M. Haddou and T. Migot, Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method, Optim. 68 (2019), no. 2-3, 509–538. [9] T. Hoheisel and C. Kanzow, On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints, Optim. 58 (2009), no. 4, 431–448. [10] Q. Hu, J. Wang and Y. Chen, New dualities for mathematical programs with vanishing constraints, Ann. Oper. Res., 287 (2020), 233–255. [11] R.A. Jabr, Solution to economic dispatching with disjoint feasible regions via semidefinite programming, IEEE T. Power Syst. 27 (2012), no. 1, 572–573. [12] A. Jayswal and V. Singh, The Characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints, Acta Math. Sci. 39 (2019), no. 2, 382–394. [13] S. Kazemi and N. Kanzi, Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints, J. Optim. Theory Appl. 179 (2018), no. 3, 800–819. [14] A. Khare and T. Nath, Enhanced Fritz-John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, J. Math. Anal. Appl. 472 (2019), no. , 1042–1077. [15] C. Kirches, A. Potschka, H. G. Bock and S. Sager, A parametric active set method for quadratic programs with vanishing constraints, Pacific J. Optim. 9 (2013), no. 2, 275–299. [16] N. J. Michael, C. Kirches and S. Sager, On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control, In: M. Junger & G. Reinelt (Eds.), Facets of combinatorial optimization (pp. 387-417), Springer, Berlin, 2013. [17] S.K. Mishra, V. Singh and V. Laha, On duality for mathematical programs with vanishing constraints. Ann. Oper. Res. 243 (2016), no. 1, 249–272. [18] L.T. Tung, Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints, Annal. Oper. Res. 311 (2022), 1307–1334. | ||
|
آمار تعداد مشاهده مقاله: 44,305 تعداد دریافت فایل اصل مقاله: 413 |
||