IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v26y2013i3d10.1007_s10878-012-9478-7.html
   My bibliography  Save this article

A bilevel programming problem with maximization of a supermodular function in the lower level

Author

Listed:
  • Diana Fanghänel

    (Universität Kassel)

Abstract

In bilevel programming there are two decision makers, the leader and the follower, who act in a hierarchy. In this paper we deal with a bilevel problem where the follower maximizes a supermodular function. The payoff for the leader is given by the weighted set that is chosen by the follower. To increase his payoff the leader can increase the supermodular function of the follower by a modular one, thus influencing the follower’s decision, but he has to pay a penalty for this. We want to find an optimum strategy for the leader. This is a bilevel programming problem with continuous variables in the upper level and a parametric supermodular maximization problem in the lower level. We analyze the structure of the bilevel problem. This we use to provide an equivalent one-level combinatorial problem. Finally, we investigate the properties of the new problem.

Suggested Citation

  • Diana Fanghänel, 2013. "A bilevel programming problem with maximization of a supermodular function in the lower level," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 568-584, October.
    • Handle: RePEc:spr:jcomop:v:26:y:2013:i:3:d:10.1007_s10878-012-9478-7
    DOI: 10.1007/s10878-012-9478-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9478-7
    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/s10878-012-9478-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. Diana Fanghänel & Frauke Liers, 2010. "A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 369-393, April.
    2. M. Köppe & M. Queyranne & C. T. Ryan, 2010. "Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 137-150, July.
    3. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    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. Libura, Marek, 2007. "On the adjustment problem for linear programs," European Journal of Operational Research, Elsevier, vol. 183(1), pages 125-134, November.
    2. Qin Wang & Tianyu Yang & Longshu Wu, 0. "General restricted inverse assignment problems under $$l_1$$l1 and $$l_\infty $$l∞ norms," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    3. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    4. Burkard, Rainer E. & Galavii, Mohammadreza & Gassner, Elisabeth, 2010. "The inverse Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 206(1), pages 11-17, October.
    5. Bennet Gebken & Sebastian Peitz, 2021. "Inverse multiobjective optimization: Inferring decision criteria from data," Journal of Global Optimization, Springer, vol. 80(1), pages 3-29, May.
    6. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    7. Fränk Plein & Johannes Thürauf & Martine Labbé & Martin Schmidt, 2022. "A bilevel optimization approach to decide the feasibility of bookings in the European gas market," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(3), pages 409-449, June.
    8. Gassner, Elisabeth, 2009. "Up- and downgrading the 1-center in a network," European Journal of Operational Research, Elsevier, vol. 198(2), pages 370-377, October.
    9. Yi Zhang & Liwei Zhang & Yue Wu, 2014. "The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 45-79, April.
    10. Timothy C. Y. Chan & Tim Craig & Taewoo Lee & Michael B. Sharpe, 2014. "Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy," Operations Research, INFORMS, vol. 62(3), pages 680-695, June.
    11. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    12. Zeynep Erkin & Matthew D. Bailey & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2010. "Eliciting Patients' Revealed Preferences: An Inverse Markov Decision Process Approach," Decision Analysis, INFORMS, vol. 7(4), pages 358-365, December.
    13. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
    14. Karabulut, Ezgi & Aras, Necati & Kuban Altınel, İ., 2017. "Optimal sensor deployment to increase the security of the maximal breach path in border surveillance," European Journal of Operational Research, Elsevier, vol. 259(1), pages 19-36.
    15. Vincent Mousseau & Özgür Özpeynirci & Selin Özpeynirci, 2018. "Inverse multiple criteria sorting problem," Annals of Operations Research, Springer, vol. 267(1), pages 379-412, August.
    16. George Kozanidis & Eftychia Kostarelou, 2023. "An Exact Solution Algorithm for Integer Bilevel Programming with Application in Energy Market Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 573-607, May.
    17. 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.
    18. Leonardo Lozano & J. Cole Smith, 2017. "A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem," Operations Research, INFORMS, vol. 65(3), pages 768-786, June.
    19. T. R. Wang & N. Pedroni & E. Zio & V. Mousseau, 2020. "Identification of Protective Actions to Reduce the Vulnerability of Safety‐Critical Systems to Malevolent Intentional Acts: An Optimization‐Based Decision‐Making Approach," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 565-587, March.
    20. Lili Zhang & Wenhao Guo, 2023. "Inverse Optimization Method for Safety Resource Allocation and Inferring Cost Coefficient Based on a Benchmark," Mathematics, MDPI, vol. 11(14), pages 1-15, July.

    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:jcomop:v:26:y:2013:i:3:d:10.1007_s10878-012-9478-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.