IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v182y2019i1d10.1007_s10957-019-01529-4.html
   My bibliography  Save this article

Towards Tractable Constraint Qualifications for Parametric Optimisation Problems and Applications to Generalised Nash Games

Author

Listed:
  • Didier Aussel

    (University of Perpignan, Lab. PROMES UPR CNRS 8521)

  • Anton Svensson

    (University of Perpignan, Lab. PROMES UPR CNRS 8521
    Universidad de Chile)

Abstract

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.

Suggested Citation

  • Didier Aussel & Anton Svensson, 2019. "Towards Tractable Constraint Qualifications for Parametric Optimisation Problems and Applications to Generalised Nash Games," Journal of Optimization Theory and Applications, Springer, vol. 182(1), pages 404-416, July.
    • Handle: RePEc:spr:joptap:v:182:y:2019:i:1:d:10.1007_s10957-019-01529-4
    DOI: 10.1007/s10957-019-01529-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-019-01529-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-019-01529-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Stein, Oliver & Sudermann-Merx, Nathan, 2018. "The noncooperative transportation problem and linear generalized Nash games," European Journal of Operational Research, Elsevier, vol. 266(2), pages 543-553.
    2. Axel Dreves, 2017. "Computing all solutions of linear generalized Nash equilibrium problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(2), pages 207-221, April.
    3. E. G. Birgin & G. Haeser & A. Ramos, 2018. "Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points," Computational Optimization and Applications, Springer, vol. 69(1), pages 51-75, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tiago Roux Oliveira & Victor Hugo Pereira Rodrigues & Miroslav Krstić & Tamer Başar, 2021. "Nash Equilibrium Seeking in Quadratic Noncooperative Games Under Two Delayed Information-Sharing Schemes," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 700-735, December.
    2. R. Cambini & R. Riccardi & D. Scopelliti, 2023. "Solving linear multiplicative programs via branch-and-bound: a computational experience," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.
    3. Aussel, Didier & Cao Van, Kien & Salas, David, 2023. "Optimal design of exchange water networks with control inputs in Eco-Industrial Parks," Energy Economics, Elsevier, vol. 120(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Migot, Tangi & Cojocaru, Monica-G., 2020. "A parametrized variational inequality approach to track the solution set of a generalized nash equilibrium problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1136-1147.
    2. Sagratella, Simone & Schmidt, Marcel & Sudermann-Merx, Nathan, 2020. "The noncooperative fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 373-382.
    3. Christos Pelekis & Panagiotis Promponas & Juan Alvarado & Eirini Eleni Tsiropoulou & Symeon Papavassiliou, 2021. "A fragile multi-CPR game," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 461-492, December.
    4. Baṣak Altan & Okan Örsan Özener, 2021. "A Game Theoretical Approach for Improving the Operational Efficiencies of Less-than-truckload Carriers Through Load Exchanges," Networks and Spatial Economics, Springer, vol. 21(3), pages 547-579, September.
    5. Stein, Oliver & Sudermann-Merx, Nathan, 2018. "The noncooperative transportation problem and linear generalized Nash games," European Journal of Operational Research, Elsevier, vol. 266(2), pages 543-553.
    6. Muhammad Omair & Mohammed Alkahtani & Kashif Ayaz & Ghulam Hussain & Johannes Buhl, 2022. "Supply Chain Modelling of the Automobile Multi-Stage Production Considering Circular Economy by Waste Management Using Recycling and Reworking Operations," Sustainability, MDPI, vol. 14(22), pages 1-26, November.
    7. Muhammad Omair & Misbah Ullah & Baishakhi Ganguly & Sahar Noor & Shahid Maqsood & Biswajit Sarkar, 2019. "The Quantitative Analysis of Workers’ Stress Due to Working Environment in the Production System of the Automobile Part Manufacturing Industry," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    8. Axel Dreves, 2018. "How to Select a Solution in Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 973-997, September.
    9. Nguyen T. V. Hang & Boris S. Mordukhovich & M. Ebrahim Sarabi, 2022. "Augmented Lagrangian method for second-order cone programs under second-order sufficiency," Journal of Global Optimization, Springer, vol. 82(1), pages 51-81, January.
    10. Gabriel Haeser, 2018. "A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms," Computational Optimization and Applications, Springer, vol. 70(2), pages 615-639, June.
    11. Luís Felipe Bueno & Gabriel Haeser & Luiz-Rafael Santos, 2020. "Towards an efficient augmented Lagrangian method for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 76(3), pages 767-800, July.
    12. Roberto Andreani & Ellen H. Fukuda & Gabriel Haeser & Daiana O. Santos & Leonardo D. Secchin, 2024. "Optimality Conditions for Nonlinear Second-Order Cone Programming and Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 1-33, January.
    13. Qihang Lin & Runchao Ma & Yangyang Xu, 2022. "Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization," Computational Optimization and Applications, Springer, vol. 82(1), pages 175-224, May.
    14. Rahman Khorramfar & Osman Y. Özaltın & Karl G. Kempf & Reha Uzsoy, 2022. "Managing Product Transitions: A Bilevel Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2828-2844, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:182:y:2019:i:1:d:10.1007_s10957-019-01529-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.