IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v19y2019i4d10.1007_s11067-019-9440-7.html
   My bibliography  Save this article

A Bicriteria Perspective on L-Penalty Approaches – a Corrigendum to Siddiqui and Gabriel’s L-Penalty Approach for Solving MPECs

Author

Listed:
  • Kerstin Dächert

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Sauleh Siddiqui

    (Johns Hopkins University)

  • Javier Saez-Gallego

    (Siemens Wind Power A/S)

  • Steven A. Gabriel

    (University of Maryland)

  • Juan Miguel Morales

    (University of Málaga)

Abstract

This paper presents a corrigendum to Theorems 2 and 3 in Siddiqui and Gabriel (Netw Spatial Econ 13(2):205–227, 2013). In brief, we revise the claim that their L-penalty approach yields a solution satisfying complementarity for any positive value of L, in general. This becomes evident when interpreting the L-penalty method as a weighted-sum scalarization of a bicriteria optimization problem. We also elaborate further assumptions under which the L-penalty approach yields a solution satisfying complementarity.

Suggested Citation

  • Kerstin Dächert & Sauleh Siddiqui & Javier Saez-Gallego & Steven A. Gabriel & Juan Miguel Morales, 2019. "A Bicriteria Perspective on L-Penalty Approaches – a Corrigendum to Siddiqui and Gabriel’s L-Penalty Approach for Solving MPECs," Networks and Spatial Economics, Springer, vol. 19(4), pages 1199-1214, December.
    • Handle: RePEc:kap:netspa:v:19:y:2019:i:4:d:10.1007_s11067-019-9440-7
    DOI: 10.1007/s11067-019-9440-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-019-9440-7
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-019-9440-7?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. Lei Guo & Gui-Hua Lin & Jane J. Ye, 2015. "Solving Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 234-256, July.
    2. Zhaomiao Guo & Yueyue Fan, 2017. "A Stochastic Multi-agent Optimization Model for Energy Infrastructure Planning under Uncertainty in An Oligopolistic Market," Networks and Spatial Economics, Springer, vol. 17(2), pages 581-609, June.
    3. Yohan Shim & Marte Fodstad & Steven Gabriel & Asgeir Tomasgard, 2013. "A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints," Annals of Operations Research, Springer, vol. 210(1), pages 5-31, November.
    4. Pedro A. Neto & Terry L. Friesz & Ke Han, 2016. "Electric Power Network Oligopoly as a Dynamic Stackelberg Game," Networks and Spatial Economics, Springer, vol. 16(4), pages 1211-1241, December.
    5. Huppmann, Daniel & Siddiqui, Sauleh, 2018. "An exact solution method for binary equilibrium problems with compensation and the power market uplift problem," European Journal of Operational Research, Elsevier, vol. 266(2), pages 622-638.
    6. S. Siddiqui & S. Gabriel, 2013. "An SOS1-Based Approach for Solving MPECs with a Natural Gas Market Application," Networks and Spatial Economics, Springer, vol. 13(2), pages 205-227, June.
    7. Jane J. Ye & Jin Zhang, 2014. "Enhanced Karush–Kuhn–Tucker Conditions for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 777-794, December.
    8. repec:diw:diwwpp:dp1145 is not listed on IDEAS
    9. Anne Neumann & Juan Rosellón & Hannes Weigt, 2015. "Removing Cross-Border Capacity Bottlenecks in the European Natural Gas Market—A Proposed Merchant-Regulatory Mechanism," Networks and Spatial Economics, Springer, vol. 15(1), pages 149-181, March.
    10. repec:diw:diwwpp:dp1696 is not listed on IDEAS
    11. Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2015. "On the representation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 245(3), pages 767-778.
    12. Kerstin Dächert & Kathrin Klamroth, 2015. "A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems," Journal of Global Optimization, Springer, vol. 61(4), pages 643-676, April.
    13. Yoshihiro Kanno, 2018. "Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach," Computational Optimization and Applications, Springer, vol. 71(2), pages 403-433, November.
    14. Dächert, Kerstin & Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2017. "Efficient computation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 841-855.
    15. Y. P. Aneja & K. P. K. Nair, 1979. "Bicriteria Transportation Problem," Management Science, INFORMS, vol. 25(1), pages 73-78, January.
    16. Siddiqui, Sauleh & Christensen, Adam, 2016. "Determining energy and climate market policy using multiobjective programs with equilibrium constraints," Energy, Elsevier, vol. 94(C), pages 316-325.
    17. Guo, Zhaomiao & Fan, Yueyue, 2017. "A Stochastic Multi-Agent Optimization Model for Energy Infrastructure Planning Under Uncertainty and Competition," Institute of Transportation Studies, Working Paper Series qt89s5s8hn, Institute of Transportation Studies, UC Davis.
    18. Alexander Zerrahn & Daniel Huppmann, 2017. "Network Expansion to Mitigate Market Power," Networks and Spatial Economics, Springer, vol. 17(2), pages 611-644, June.
    19. Hesamzadeh, M.R. & Rosellón, J. & Gabriel, S.A. & Vogelsang, I., 2018. "A simple regulatory incentive mechanism applied to electricity transmission pricing and investment," Energy Economics, Elsevier, vol. 75(C), pages 423-439.
    Full references (including those not matched with items on IDEAS)

    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. Dávid Csercsik & László Á. Kóczy, 2017. "Efficiency and Stability in Electrical Power Transmission Networks: a Partition Function Form Approach," Networks and Spatial Economics, Springer, vol. 17(4), pages 1161-1184, December.
    2. Kerstin Dächert & Tino Fleuren & Kathrin Klamroth, 2024. "A simple, efficient and versatile objective space algorithm for multiobjective integer programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 351-384, August.
    3. Kerstin Dächert & Ria Grindel & Elisabeth Leoff & Jonas Mahnkopp & Florian Schirra & Jörg Wenzel, 2022. "Multicriteria asset allocation in practice," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 349-373, June.
    4. Diego Pecin & Ian Herszterg & Tyler Perini & Natashia Boland & Martin Savelsbergh, 2024. "A fast and robust algorithm for solving biobjective mixed integer programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 221-262, August.
    5. Ozgu Turgut & Evrim Dalkiran & Alper E. Murat, 2019. "An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems," Journal of Global Optimization, Springer, vol. 75(1), pages 35-62, September.
    6. Doğan, Ilgın & Lokman, Banu & Köksalan, Murat, 2022. "Representing the nondominated set in multi-objective mixed-integer programs," European Journal of Operational Research, Elsevier, vol. 296(3), pages 804-818.
    7. Pham Thi Hoai & Hoai An Le Thi & Nguyen Canh Nam, 2021. "Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects," 4OR, Springer, vol. 19(1), pages 41-70, March.
    8. Dächert, Kerstin & Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2017. "Efficient computation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 841-855.
    9. Yogendra Pandey & S. K. Mishra, 2018. "Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators," Annals of Operations Research, Springer, vol. 269(1), pages 549-564, October.
    10. Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
    11. Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein, 2021. "A general branch-and-bound framework for continuous global multiobjective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 195-227, May.
    12. Fan, Yueyue & Zhang, Yunteng, 2019. "Next-Generation Transit System Design During a Revolution of Shared Mobility," Institute of Transportation Studies, Working Paper Series qt77t6g3w4, Institute of Transportation Studies, UC Davis.
    13. Burdett, Robert L & Corry, Paul & Yarlagadda, Prasad & Cook, David & Birgan, Sean, 2024. "Multicriteria optimization techniques for understanding the case mix landscape of a hospital," European Journal of Operational Research, Elsevier, vol. 319(1), pages 263-291.
    14. David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
    15. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
    16. Gabriele Eichfelder & Oliver Stein & Leo Warnow, 2024. "A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1736-1766, November.
    17. D. Khastieva & M. R. Hesamzadeh & I. Vogelsang & J. Rosellón, 2020. "Transmission Network Investment Using Incentive Regulation: A Disjunctive Programming Approach," Networks and Spatial Economics, Springer, vol. 20(4), pages 1029-1068, December.
    18. Eichfelder, Gabriele & Warnow, Leo, 2023. "Advancements in the computation of enclosures for multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 310(1), pages 315-327.
    19. Kerstin Dachert & Ria Grindel & Elisabeth Leoff & Jonas Mahnkopp & Florian Schirra & Jorg Wenzel, 2021. "Multicriteria asset allocation in practice," Papers 2103.10958, arXiv.org.
    20. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.

    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:kap:netspa:v:19:y:2019:i:4:d:10.1007_s11067-019-9440-7. 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.