In this paper, considering the mathematical programs with equilibrium constraints is difficult to meet the constrained qualification and difficult to solve, we establish a class of generalized Mond-Weir type duality of equilibrium constrained optimization problem. Using the S-stability, we propose the duality theory, which is based on the dual form of standard nonlinear programming proposed by Mond and Weir. The theory provides a new method for solving the problem of equilibrium constraint optimization. Under the condition of Hanson-Mond generalized convexity, the weak duality, strong duality and strict inverse duality theorems are proposed by using the sublinear function, and the corresponding proofs are given. The generalization of the dual method provides a theoretical basis for studying the solution of the mathematical programs with equilibrium constraints.
GAO Leifu, YAN Tingting
. A class of generalized mond-weir type duality theory for mathematical programs with equilibrium constraints[J]. Operations Research Transactions, 2019
, 23(2)
: 95
-103
.
DOI: 10.15960/j.cnki.issn.1007-6093.2019.02.009
[1] Outrata J, Kocvara M, Zowe J. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints:Theory, Applications and Numerical Results[M]. Berlin:Springer Science & Business Media, 2013.
[2] Luo Z Q, Pang J S, Ralph D. Mathematical Programs with Equilibrium Constraints[M]. London:Cambridge University Press, 1996.
[3] Fukushima M, Lin G H. Smoothing methods for mathematical programs with equilibrium constraints[C]//International Conference on Informatics Research for Development of Knowledge Society Infrastructure. Tokyo:IEEE Computer Society, 2004:206-213.
[4] Guo L, Lin G H. Notes on some constraint qualifications for mathematical programs with equilibrium constraints[J]. Journal of Optimization Theory and Applications, 2013, 156(3):600-616.
[5] Guo L, Lin G H, Ye J J. Stability analysis for parametric mathematical programs with geometric constraints and its applications[J]. SIAM Journal on Optimization, 2012, 22(3):1151-1176.
[6] Kanzow C, Schwartz A. Mathematical programs with equilibrium constraints:enhanced Fritz John-conditions, new constraint qualifications, and improved exact penalty results[J]. SIAM Journal on Optimization, 2010, 20(5):2730-2753.
[7] Scheel H, Scholtes S. Mathematical programs with complementarity constraints:Stationarity, optima-lity, and sensitivity[J]. Mathematics of Operations Research, 2000, 25(1):1-22.
[8] Dempe S. Foundations of bilevel programming[M]//Nonconvex Optimization and its Applications, New York:Springer, 2002.
[9] Jane J Y. Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints[J]. Journal of Mathematical Analysis and Applications, 2005, 307(1):350-369.
[10] Wolfe P. A duality theorem for nonlinear programming[J]. Quarterly of Applied Mathematics, 1961, 19(3):239-244.
[11] Mond B, Weir T. Generalized concavity and duality[J]. Generalized Concavity in Optimization and Economics, 1981, 22(1):263-279.
[12] Mishra S K, Jaiswal M, An L T H. Duality for nonsmooth semi-infinite programming problems[J]. Optimization Letters, 2012, 6(2):261-271.
[13] Suneja S K, Kohli B. Optimality and duality results for bilevel programming problem using convexifactors[J]. Journal of Optimization Theory and Applications, 2011, 150(1):1-19.
[14] Mishra S K, Singh V, Laha V. On duality for mathematical programs with vanishing constraints[J]. Annals of Operations Research, 2016, 243(1):249-272.
[15] Hanson M A, Mond B. Further generalizations of convexity in mathematical programming[J]. Journal of Information and Optimization Sciences, 1982, 3(1):25-32.
[16] Egudo R R, Mond B. Duality with generalized convexity[J]. The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1986, 28(1):10-21.
[17] Scheel H, Scholtes S. Mathematical programs with complementarity constraints:Stationarity, optimality, and sensitivity[J]. Mathematics of Operations Research, 2000, 25(1):1-22.
[18] Jane J Y. Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints[J]. Journal of Mathematical Analysis and Applications, 2005, 307(1):350-369.
