IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v68y2017i4d10.1007_s10898-017-0502-4.html
   My bibliography  Save this article

Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers

Author

Listed:
  • Abay Molla Kassa

    (University of Bergen)

  • Semu Mitiku Kassa

    (Addis Ababa University
    Botswana International University of Science and Technology (BIUST))

Abstract

In this paper we investigate multilevel programming problems with multiple followers in each hierarchical decision level. It is known that such type of problems are highly non-convex and hard to solve. A solution algorithm have been proposed by reformulating the given multilevel program with multiple followers at each level that share common resources into its equivalent multilevel program having single follower at each decision level. Even though, the reformulated multilevel optimization problem may contain non-convex terms at the objective functions at each level of the decision hierarchy, we applied multi-parametric branch-and-bound algorithm to solve the resulting problem that has polyhedral constraints. The solution procedure is implemented and tested for a variety of illustrative examples.

Suggested Citation

  • Abay Molla Kassa & Semu Mitiku Kassa, 2017. "Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers," Journal of Global Optimization, Springer, vol. 68(4), pages 729-747, August.
    • Handle: RePEc:spr:jglopt:v:68:y:2017:i:4:d:10.1007_s10898-017-0502-4
    DOI: 10.1007/s10898-017-0502-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-017-0502-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/s10898-017-0502-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. T. Başar & R. Srikant, 2002. "A Stackelberg Network Game with a Large Number of Followers," Journal of Optimization Theory and Applications, Springer, vol. 115(3), pages 479-490, December.
    2. R. G. Cassidy & M. J. L. Kirby & W. M. Raike, 1971. "Efficient Distribution of Resources Through Three Levels of Government," Management Science, INFORMS, vol. 17(8), pages 462-473, April.
    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. Seyfe Belete Worku & Birilew Belayneh Tsegaw & Semu Mitiku Kassa, 2023. "Existence and computations of best affine strategies for multilevel reverse Stackelberg games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 339-366, June.
    2. Addis Belete Zewde & Semu Mitiku Kassa, 2021. "Multilevel multi-leader multiple-follower games with nonseparable objectives and shared constraints," Computational Management Science, Springer, vol. 18(4), pages 455-475, October.
    3. Natnael Nigussie Goshu & Semu Mitiku Kassa, 2024. "A solution method for stochastic multilevel programming problems. A systematic sampling evolutionary approach," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(1), pages 149-174.
    4. Seyfe Belete Worku & Birilew Belayneh Tsegaw & Semu Mitiku Kassa, 2023. "Multilevel Reverse Stackelberg Differential Games: Existence and Solution Approach for Affine Strategies," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 617-640, February.

    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. Panayides, Michalis & Knight, Vince & Harper, Paul, 2023. "A game theoretic model of the behavioural gaming that takes place at the EMS - ED interface," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1236-1258.
    2. Song, Malin & Xie, Qianjiao & Tan, Kim Hua & Wang, Jianlin, 2020. "A fair distribution and transfer mechanism of forest tourism benefits in China," China Economic Review, Elsevier, vol. 63(C).
    3. Mao, Ying & Wang, Liqing & Liu, Yang & Lu, Jianquan & Wang, Zhen, 2018. "Stabilization of evolutionary networked games with length-r information," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 442-451.
    4. van Hoesel, Stan, 2008. "An overview of Stackelberg pricing in networks," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1393-1402, September.
    5. 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.
    6. Konstantinos Ziliaskopoulos & Konstantinos Papalamprou, 2022. "A Bilevel Linear Programming Model for Developing a Subsidy Policy to Minimize the Environmental Impact of the Agricultural Sector," Sustainability, MDPI, vol. 14(13), pages 1-10, June.
    7. Eduardo Mojica-Nava & Fredy Ruiz, 2021. "Stackelberg Population Dynamics: A Predictive-Sensitivity Approach," Games, MDPI, vol. 12(4), pages 1-15, November.
    8. Chen, Lv & Shen, Yang, 2019. "Stochastic Stackelberg differential reinsurance games under time-inconsistent mean–variance framework," Insurance: Mathematics and Economics, Elsevier, vol. 88(C), pages 120-137.
    9. Isabel Amigo & Pablo Belzarena & Sandrine Vaton, 2013. "A pricing scheme for QoS in overlay networks based on first-price auctions and reimbursement," Netnomics, Springer, vol. 14(1), pages 69-93, November.
    10. Michael N. Vrahatis & Panagiotis Kontogiorgos & George P. Papavassilopoulos, 2020. "Particle Swarm Optimization for Computing Nash and Stackelberg Equilibria in Energy Markets," SN Operations Research Forum, Springer, vol. 1(3), pages 1-23, September.
    11. 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.
    12. Liu, Yi-Hsin & Spencer, Thomas H., 1995. "Solving a bilevel linear program when the inner decision maker controls few variables," European Journal of Operational Research, Elsevier, vol. 81(3), pages 644-651, March.
    13. Mathur, Kanchan & Puri, M. C., 1995. "A bilevel bottleneck programming problem," European Journal of Operational Research, Elsevier, vol. 86(2), pages 337-344, October.
    14. Elias Vathias & Stathes Hadjiefthymiades, 2021. "A stock options metaphor for content delivery networks," Netnomics, Springer, vol. 22(2), pages 195-230, December.
    15. Xie Ding, 2012. "Equilibrium existence theorems for multi-leader-follower generalized multiobjective games in FC-spaces," Journal of Global Optimization, Springer, vol. 53(3), pages 381-390, July.
    16. Elias Vathias & Stathes Hadjiefthymiades, 2022. "A stock options metaphor for content delivery networks," Netnomics, Springer, vol. 22(2), pages 195-230, October.
    17. Chen, Ruoyun & Nozick, Linda, 2016. "Integrating congestion pricing and transit investment planning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 89(C), pages 124-139.

    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:jglopt:v:68:y:2017:i:4:d:10.1007_s10898-017-0502-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.