IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v153y2012i2d10.1007_s10957-011-9945-9.html
   My bibliography  Save this article

An Objective Penalty Function of Bilevel Programming

Author

Listed:
  • Zhiqing Meng

    (Zhejiang University of Technology)

  • Chuangyin Dang

    (City University of Hong Kong)

  • Rui Shen

    (Zhejiang University of Technology)

  • Ming Jiang

    (Zhejiang University of Technology)

Abstract

Penalty methods are very efficient in finding an optimal solution to constrained optimization problems. In this paper, we present an objective penalty function with two penalty parameters for inequality constrained bilevel programming under the convexity assumption to the lower level problem. Under some conditions, an optimal solution to a bilevel programming defined by the objective penalty function is proved to be an optimal solution to the original bilevel programming. Moreover, based on the objective penalty function, an algorithm is developed to obtain an optimal solution to the original bilevel programming, with its convergence proved under some conditions.

Suggested Citation

  • Zhiqing Meng & Chuangyin Dang & Rui Shen & Ming Jiang, 2012. "An Objective Penalty Function of Bilevel Programming," Journal of Optimization Theory and Applications, Springer, vol. 153(2), pages 377-387, May.
    • Handle: RePEc:spr:joptap:v:153:y:2012:i:2:d:10.1007_s10957-011-9945-9
    DOI: 10.1007/s10957-011-9945-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-011-9945-9
    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-011-9945-9?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. G. S. Liu & J. Y. Han & J. Z. Zhang, 2001. "Exact Penalty Functions for Convex Bilevel Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 621-643, September.
    2. Ankhili, Z. & Mansouri, A., 2009. "An exact penalty on bilevel programs with linear vector optimization lower level," European Journal of Operational Research, Elsevier, vol. 197(1), pages 36-41, August.
    3. Yang, Hai & Zhang, Xiaoning & Meng, Qiang, 2007. "Stackelberg games and multiple equilibrium behaviors on networks," Transportation Research Part B: Methodological, Elsevier, vol. 41(8), pages 841-861, October.
    4. Kogan, Konstantin & Tapiero, Charles S., 2009. "Optimal co-investment in supply chain infrastructure," European Journal of Operational Research, Elsevier, vol. 192(1), pages 265-276, January.
    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. (Walker) Wang, Wei & Wang, David Z.W. & Sun, Huijun & Feng, Zengzhe & Wu, Jianjun, 2016. "Braess Paradox of traffic networks with mixed equilibrium behaviors," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 95-114.
    2. Changrong Liu & Hanqing Wang & Zhiqiang Liu & Zhiyong Wang & Sheng Yang, 2021. "Research on a Bi-Level Collaborative Optimization Method for Planning and Operation of Multi-Energy Complementary Systems," Energies, MDPI, vol. 14(23), pages 1-20, November.
    3. Andrzej Grzybowski, 2009. "A Note On A Single Vehicle And One Destination Routing Problem And Its Game-Theoretic Models," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 3(1), pages 71-76, December.
    4. Van Gorder, Robert A. & Caputo, Michael R., 2010. "Envelope theorems for locally differentiable open-loop Stackelberg equilibria of finite horizon differential games," Journal of Economic Dynamics and Control, Elsevier, vol. 34(6), pages 1123-1139, June.
    5. Wang, Hua & Meng, Qiang & Zhang, Xiaoning, 2020. "Multiple equilibrium behaviors of auto travellers and a freight carrier under the cordon-based large-truck restriction regulation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    6. Aalami, Soheila & Kattan, Lina, 2022. "Proportionally fair flow markets for transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 24-41.
    7. Maria João Alves & Carlos Henggeler Antunes & João Paulo Costa, 2021. "New concepts and an algorithm for multiobjective bilevel programming: optimistic, pessimistic and moderate solutions," Operational Research, Springer, vol. 21(4), pages 2593-2626, December.
    8. Hugo E. Silva & Robin Lindsey & André de Palma & Vincent A. C. van den Berg, 2017. "On the Existence and Uniqueness of Equilibrium in the Bottleneck Model with Atomic Users," Transportation Science, INFORMS, vol. 51(3), pages 863-881, August.
    9. Marina Prechtel & Günter Leugering & Paul Steinmann & Michael Stingl, 2012. "Optimal Design of Brittle Composite Materials: a Nonsmooth Approach," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 962-985, December.
    10. Farokhi, Farhad & Johansson, Karl H., 2015. "A piecewise-constant congestion taxing policy for repeated routing games," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 123-143.
    11. Xia Yang & Xuegang Jeff Ban & Rui Ma, 2017. "Mixed Equilibria with Common Constraints on Transportation Networks," Networks and Spatial Economics, Springer, vol. 17(2), pages 547-579, June.
    12. Wang, Hua & Meng, Qiang & Zhang, Xiaoning, 2014. "Game-theoretical models for competition analysis in a new emerging liner container shipping market," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 201-227.
    13. (Jeff) Ban, Xuegang & Dessouky, Maged & Pang, Jong-Shi & Fan, Rong, 2019. "A general equilibrium model for transportation systems with e-hailing services and flow congestion," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 273-304.
    14. Huang, Yeu-Shiang & Chen, Si-Hen & Ho, Jyh-Wen, 2013. "A study on pricing and delivery strategy for e-retailing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 59(C), pages 71-84.
    15. Cheng Wan, 2016. "Strategic decentralization in binary choice composite congestion games," Post-Print hal-02885837, HAL.
    16. Yang, Hai & Zhang, Xiaoning, 2008. "Existence of anonymous link tolls for system optimum on networks with mixed equilibrium behaviors," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 99-112, February.
    17. Henri Bonnel & Christopher Schneider, 2019. "Post-Pareto Analysis and a New Algorithm for the Optimal Parameter Tuning of the Elastic Net," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 993-1027, December.
    18. Kian, Ramez & Gürler, Ülkü & Berk, Emre, 2014. "The dynamic lot-sizing problem with convex economic production costs and setups," International Journal of Production Economics, Elsevier, vol. 155(C), pages 361-379.
    19. Wan, Cheng, 2016. "Strategic decentralization in binary choice composite congestion games," European Journal of Operational Research, Elsevier, vol. 250(2), pages 531-542.
    20. Minyu Shen & Feng Xiao & Weihua Gu & Hongbo Ye, 2024. "Cognitive Hierarchy in Day-to-day Network Flow Dynamics," Papers 2409.11908, arXiv.org.

    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:153:y:2012:i:2:d:10.1007_s10957-011-9945-9. 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.