IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v185y2020i2d10.1007_s10957-020-01658-1.html
   My bibliography  Save this article

Analysis of a New Sequential Optimality Condition Applied to Mathematical Programs with Equilibrium Constraints

Author

Listed:
  • Elias S. Helou

    (University of São Paulo)

  • Sandra A. Santos

    (University of Campinas)

  • Lucas E. A. Simões

    (University of Campinas)

Abstract

In this study, a novel sequential optimality condition for general continuous optimization problems is established. In the context of mathematical programs with equilibrium constraints, the condition is proved to ensure Clarke stationarity. Originally devised for constrained nonsmooth optimization, the proposed sequential optimality condition addresses the domain of the constraints instead of their images, capturing indistinctly the features of the complementarity and the ordinary constraints of optimization problems modeling equilibrium conditions.

Suggested Citation

  • Elias S. Helou & Sandra A. Santos & Lucas E. A. Simões, 2020. "Analysis of a New Sequential Optimality Condition Applied to Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 185(2), pages 433-447, May.
  • Handle: RePEc:spr:joptap:v:185:y:2020:i:2:d:10.1007_s10957-020-01658-1
    DOI: 10.1007/s10957-020-01658-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-020-01658-1
    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-020-01658-1?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. Holger Scheel & Stefan Scholtes, 2000. "Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 1-22, February.
    2. Bard, Jonathan F. & Plummer, John & Claude Sourie, Jean, 2000. "A bilevel programming approach to determining tax credits for biofuel production," European Journal of Operational Research, Elsevier, vol. 120(1), pages 30-46, January.
    3. J. V. Outrata, 1999. "Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 627-644, August.
    4. Joydeep Dutta & Kalyanmoy Deb & Rupesh Tulshyan & Ramnik Arora, 2013. "Approximate KKT points and a proximity measure for termination," Journal of Global Optimization, Springer, vol. 56(4), pages 1463-1499, August.
    5. Didier Aussel & Anton Svensson, 2019. "Is Pessimistic Bilevel Programming a Special Case of a Mathematical Program with Complementarity Constraints?," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 504-520, May.
    6. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    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. Ademir A. Ribeiro & Mael Sachine & Evelin H. M. Krulikovski, 2022. "A Comparative Study of Sequential Optimality Conditions for Mathematical Programs with Cardinality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 1067-1083, March.
    2. Renan W. Prado & Sandra A. Santos & Lucas E. A. Simões, 2023. "On the Fulfillment of the Complementary Approximate Karush–Kuhn–Tucker Conditions and Algorithmic Applications," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 705-736, May.

    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. Acuna, Jorge A. & Zayas-Castro, Jose L. & Feijoo, Felipe, 2022. "A bilevel Nash-in-Nash model for hospital mergers: A key to affordable care," Socio-Economic Planning Sciences, Elsevier, vol. 83(C).
    2. Christian Kanzow & Alexandra Schwartz, 2015. "The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 253-275, February.
    3. Thai Doan Chuong, 2020. "Optimality conditions for nonsmooth multiobjective bilevel optimization problems," Annals of Operations Research, Springer, vol. 287(2), pages 617-642, April.
    4. Feijoo, Felipe & Das, Tapas K., 2014. "Design of Pareto optimal CO2 cap-and-trade policies for deregulated electricity networks," Applied Energy, Elsevier, vol. 119(C), pages 371-383.
    5. Xi, Haoning & Aussel, Didier & Liu, Wei & Waller, S.Travis. & Rey, David, 2024. "Single-leader multi-follower games for the regulation of two-sided mobility-as-a-service markets," European Journal of Operational Research, Elsevier, vol. 317(3), pages 718-736.
    6. Hecheng Li, 2015. "A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems," Annals of Operations Research, Springer, vol. 235(1), pages 543-558, December.
    7. Juan S. Borrero & Oleg A. Prokopyev & Denis Sauré, 2019. "Sequential Interdiction with Incomplete Information and Learning," Operations Research, INFORMS, vol. 67(1), pages 72-89, January.
    8. Bo Zeng, 2020. "A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1128-1142, October.
    9. Yemshanov, Denys & Haight, Robert G. & MacQuarrie, Chris J.K. & Simpson, Mackenzie & Koch, Frank H. & Ryan, Kathleen & Bullas-Appleton, Erin, 2022. "Hierarchical governance in invasive species survey campaigns," Ecological Economics, Elsevier, vol. 201(C).
    10. Jean-Pierre Dussault & Mounir Haddou & Abdeslam Kadrani & Tangi Migot, 2020. "On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 504-522, August.
    11. Jing Hu & John Mitchell & Jong-Shi Pang & Bin Yu, 2012. "On linear programs with linear complementarity constraints," Journal of Global Optimization, Springer, vol. 53(1), pages 29-51, May.
    12. Dussault, Jean-Pierre & Marcotte, Patrice & Roch, Sebastien & Savard, Gilles, 2006. "A smoothing heuristic for a bilevel pricing problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1396-1413, November.
    13. Zhao, Ning & You, Fengqi, 2019. "Dairy waste-to-energy incentive policy design using Stackelberg-game-based modeling and optimization," Applied Energy, Elsevier, vol. 254(C).
    14. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    15. Wang, Guangmin & Xu, Meng & Grant-Muller, Susan & Gao, Zaihan, 2020. "Combination of tradable credit scheme and link capacity improvement to balance economic growth and environmental management in sustainable-oriented transport development: A bi-objective bi-level progr," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 459-471.
    16. M. Hosein Zare & Oleg A. Prokopyev & Denis Sauré, 2020. "On Bilevel Optimization with Inexact Follower," Decision Analysis, INFORMS, vol. 17(1), pages 74-95, March.
    17. M.L. Flegel & C. Kanzow, 2005. "Abadie-Type Constraint Qualification for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 124(3), pages 595-614, March.
    18. Lei Guo & Gaoxi Li, 2024. "Approximation Methods for a Class of Non-Lipschitz Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1421-1445, September.
    19. Hossa Almutairi & Samir Elhedhli, 2014. "Carbon tax based on the emission factor: a bilevel programming approach," Journal of Global Optimization, Springer, vol. 58(4), pages 795-815, April.
    20. Polyxeni-Margarita Kleniati & Claire Adjiman, 2014. "Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development," Journal of Global Optimization, Springer, vol. 60(3), pages 425-458, November.

    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:185:y:2020:i:2:d:10.1007_s10957-020-01658-1. 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.