均衡约束数学规划问题的一类广义Mond-Weir型对偶理论

doi:10.15960/j.cnki.issn.1007-6093.2019.02.009

Abstract

Abstract: 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.

Key words: mathematical programs with equilibrium constraints (MPEC), generalized Mond-Weir type duality, stability point

CLC Number:

O224

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.

References 18

[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.

A class of generalized mond-weir type duality theory for mathematical programs with equilibrium constraints

PDF

Knowledge

Abstract

Cite this article

share this article

References 18

Related Articles 15

Recommended Articles

Metrics

Comments

[1]	KE Rongzhu, ZHANG Jin. On the first order approach for bilevel programming: moral hazard case [J]. Operations Research Transactions, 2021, 25(3): 87-104.
[2]	SUN Cong, ZHANG Ya. A brief review on gradient method [J]. Operations Research Transactions, 2021, 25(3): 119-132.
[3]	JIANG Bo, ZHU Xihua. Robust portfolio selection based on cross-sectional regression and Fama-Macbeth estimator [J]. Operations Research Transactions, 2021, 25(3): 133-146.
[4]	WANG Shuangyue, LUO Ziyan. Low rank support tensor machine based on L_0/1 soft-margin loss function [J]. Operations Research Transactions, 2021, 25(3): 160-172.
[5]	LIU Zhiping. Some advances in gene regulatory network inference [J]. Operations Research Transactions, 2021, 25(3): 173-182.
[6]	TANG Wei, YANG Yun. Sensitivity for the second-order S-derivative of the perturbation map in set-valued optimization [J]. Operations Research Transactions, 2020, 24(4): 83-92.
[7]	ZHAO Chen, LUO Ziyan, XIU Naihua. Some advances in theory and algorithms for sparse optimization [J]. Operations Research Transactions, 2020, 24(4): 1-24.
[8]	PAN Shaohua, WEN Zaiwen. Models and algorithms for low-rank and sparse matrix optimization problems [J]. Operations Research Transactions, 2020, 24(3): 1-26.
[9]	ZHONG Weiya, SHI Yimei. Robust optimization of rehearsal scheduling under uncertain duration [J]. Operations Research Transactions, 2020, 24(3): 77-86.
[10]	YU Haibo, NA Na, TANG Zhongjun. Service decision and coordination contracts of supply chain with mean-CVaR retailer [J]. Operations Research Transactions, 2020, 24(3): 87-100.
[11]	YANG Linxi, LI Guoquan. Sparse proximal support vector machines via DC programming [J]. Operations Research Transactions, 2020, 24(3): 115-126.
[12]	GUO Ke, WANG Tao, Zhang Youcai. Generalized viscosity approximation method and its application [J]. Operations Research Transactions, 2020, 24(3): 127-140.
[13]	HE Asi, ZHANG Shenggui. A new modified SR1 update formulas and its algorithm convergence [J]. Operations Research Transactions, 2020, 24(3): 141-153.
[14]	LI Xinrong, XIU Naihua, LUO Ziyan. Some advances in low-rank matrix optimization [J]. Operations Research Transactions, 2020, 24(2): 23-41.
[15]	REN Yequan, BAI Yanqin, LI Qian, YU Changjun, ZHANG Liansheng. A second-order cone programming algorithm for pooling problem [J]. Operations Research Transactions, 2020, 24(2): 61-72.