均衡约束数学规划问题的一类广义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.

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

URL: https://www.ort.shu.edu.cn/EN/10.15960/j.cnki.issn.1007-6093.2019.02.009

https://www.ort.shu.edu.cn/EN/Y2019/V23/I2/95

[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

Related Articles 15

Recommended Articles

Metrics

Comments

[1]	YU Sijie, LONG Xianjun. An adaptive algorithm for solving quasimonotone variational inequality problems [J]. Operations Research Transactions, 2026, 30(2): 179-193.
[2]	QIU Yingming, PENG Jianwen. Improved q-trust region algorithm for unconstrained optimization problems [J]. Operations Research Transactions, 2026, 30(2): 209-224.
[3]	HUANG Yin, LUO Hezhi. A faster SDP relaxation for two-period financial derivatives liquidation problem [J]. Operations Research Transactions, 2026, 30(1): 108-120.
[4]	CHEN Rongjun, LIU Yongcai, HUANG He, TANG Guochun. Dynamic programming algorithms for single machine supply chain scheduling [J]. Operations Research Transactions, 2026, 30(1): 171-178.
[5]	Kaiyuan JIN, Feifeng ZHENG, Ming LIU. Online scheduling model of batch processing machine considering order types and setup time [J]. Operations Research Transactions, 2025, 29(4): 231-240.
[6]	Zilin TAN, Honglin LUO. A second-order splitting method with its application [J]. Operations Research Transactions, 2025, 29(4): 121-140.
[7]	Jiawen YANG, Heming SUN. An iterative algorithm for the optimal approximation solution of matrix equations AXB + CY D = E with generalized constraints [J]. Operations Research Transactions, 2025, 29(4): 27-47.
[8]	Kang ZENG, Xianjun LONG. A golden ratio proximal alternating linearized algorithm for nonconvex composite optimization problems [J]. Operations Research Transactions, 2025, 29(2): 80-94.
[9]	Miaohui HE, Xuxiang DUAN, Zhiyou WU. A new algorithm for improving the completion performance of knowledge graph of long-tail data [J]. Operations Research Transactions, 2025, 29(1): 41-54.
[10]	Jing LI, Linmin HU, Mingjia LI. Reliability modeling and optimization of k=(M+N): G system based on retrial mechanism and switching failure [J]. Operations Research Transactions, 2024, 28(4): 44-56.
[11]	Shengxiang DENG, Xudong LI. Fast computation of generalized Jacobians of polyhedral projectors and extensions [J]. Operations Research Transactions, 2023, 27(4): 61-80.
[12]	Jing YU, Zhe XU, Fang XIE. A branch and bound method for project scheduling problem with activities overlapping [J]. Operations Research Transactions, 2023, 27(1): 115-126.
[13]	Yubo DAI, Yihong DUAN, Longcheng LIU, Zihao WANG. Randomized approximation algorithms for a class of one-dimensional online unit clustering problem [J]. Operations Research Transactions, 2022, 26(3): 143-150.
[14]	Jiahao LYU, Honglin LUO, Zehua YANG, Jianwen PENG. A stochastic Bregman ADMM with its application in training sparse structure SVMs [J]. Operations Research Transactions, 2022, 26(2): 16-30.
[15]	Huiling ZHANG, Naoerzai SAI, Xiaoyun WU. Modified PRP conjugate gradient method for unconstrained optimization [J]. Operations Research Transactions, 2022, 26(2): 64-72.