Towards Tractable Constraint Qualifications for Parametric Optimisation Problems and Applications to Generalised Nash Games
- 64 Downloads
A generalised Nash game is a non-cooperative game in which each player is facing an optimisation problem where both the objective function and the feasible set depend on the variables of the other players. A classical way to treat numerically this difficult problem is to solve the nonlinear system composed of the concatenation of the Karush–Kuhn–Tucker optimality conditions of each player’s problem. The aim of this work is to provide constraint qualification conditions ensuring that both problems share the same set of solutions. Our main target here is to elaborate tractable conditions, that is, sets of conditions that are as simple as possible to fulfil. This is achieved through the analysis of “minimal” qualification conditions for parametric optimisation problems.
KeywordsParametric optimisation Constraint qualifications KKT conditions GNEP Joint convexity
Mathematics Subject Classification90C31 90C33 90C46 91A40
This research benefited from the support of the FMJH Program Gaspard Monge in optimisation and operation research, and from the support to this program from EDF. The second author was also benefited by a grant CONICYT-PFCHA/Doctorado Nacional/2018 N21180645.
- 7.Sudermann-Merx, N.G.: Linear generalized nash equilibrium problems. Ph.D. thesis, Karlsruher Instituts fur Technologie (2016)Google Scholar
- 12.Bueno, L., Haeser, G., Rojas, F.: Optimality conditions and constraint qualifications for generalized nash equilibrium problems and their practical implications. SIAM J. Optim. pp. 31–54 (2019). https://doi.org/10.1137/17M1162524