An algorithm for the discrete bilevel programming problem
Author
Abstract
Suggested Citation
DOI: 10.1002/1520-6750(199204)39:33.0.CO;2-C
Download full text from publisher
References listed on IDEAS
- Bard, JF & Moore, JT, 1990. "Production planning with variable demand," Omega, Elsevier, vol. 18(1), pages 35-42.
- Soyster, A. L., 1979. "Inexact linear programming with generalized resource sets," European Journal of Operational Research, Elsevier, vol. 3(4), pages 316-321, July.
- James T. Moore & Jonathan F. Bard, 1990. "The Mixed Integer Linear Bilevel Programming Problem," Operations Research, INFORMS, vol. 38(5), pages 911-921, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Tanınmış, Kübra & Aras, Necati & Altınel, İ. Kuban, 2022. "Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks," European Journal of Operational Research, Elsevier, vol. 297(1), pages 40-52.
- F. Hooshmand & S. A. MirHassani, 2018. "An Effective Bilevel Programming Approach for the Evasive Flow Capturing Location Problem," Networks and Spatial Economics, Springer, vol. 18(4), pages 909-935, December.
- Rahman Khorramfar & Osman Y. Özaltın & Karl G. Kempf & Reha Uzsoy, 2022. "Managing Product Transitions: A Bilevel Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2828-2844, September.
- van Ackooij, Wim & De Boeck, Jérôme & Detienne, Boris & Pan, Stefania & Poss, Michael, 2018. "Optimizing power generation in the presence of micro-grids," European Journal of Operational Research, Elsevier, vol. 271(2), pages 450-461.
- Ghavamifar, Ali & Makui, Ahmad & Taleizadeh, Ata Allah, 2018. "Designing a resilient competitive supply chain network under disruption risks: A real-world application," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 87-109.
- Jabarzare, Ziba & Zolfagharinia, Hossein & Najafi, Mehdi, 2020. "Dynamic interdiction networks with applications in illicit supply chains," Omega, Elsevier, vol. 96(C).
- Fakhry, Ramy & Hassini, Elkafi & Ezzeldin, Mohamed & El-Dakhakhni, Wael, 2022. "Tri-level mixed-binary linear programming: Solution approaches and application in defending critical infrastructure," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1114-1131.
- Milička, P. & Šůcha, P. & Vanhoucke, M. & Maenhout, B., 2022. "The bilevel optimisation of a multi-agent project scheduling and staffing problem," European Journal of Operational Research, Elsevier, vol. 296(1), pages 72-86.
- 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.
- Liu, Shaonan & Wang, Mingzheng & Kong, Nan & Hu, Xiangpei, 2021. "An enhanced branch-and-bound algorithm for bilevel integer linear programming," European Journal of Operational Research, Elsevier, vol. 291(2), pages 661-679.
- Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
- Dajun Yue & Jiyao Gao & Bo Zeng & Fengqi You, 2019. "A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs," Journal of Global Optimization, Springer, vol. 73(1), pages 27-57, January.
- Junlong Zhang & Osman Y. Özaltın, 2021. "Bilevel Integer Programs with Stochastic Right-Hand Sides," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1644-1660, October.
- Tolga H. Seyhan & Lawrence V. Snyder & Ying Zhang, 2018. "A New Heuristic Formulation for a Competitive Maximal Covering Location Problem," Transportation Science, INFORMS, vol. 52(5), pages 1156-1173, October.
- Mofidi, Seyed Shahab & Pazour, Jennifer A., 2019. "When is it beneficial to provide freelance suppliers with choice? A hierarchical approach for peer-to-peer logistics platforms," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 1-23.
- Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.
- Caballero, William N. & Lunday, Brian J. & Meissner, Finn, 2024. "Regulating the rebound effect in the traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 317(3), pages 660-677.
- Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.
- Mintz, Yonatan & Aswani, Anil & Kaminsky, Philip & Flowers, Elena & Fukuoka, Yoshimi, 2023. "Behavioral analytics for myopic agents," European Journal of Operational Research, Elsevier, vol. 310(2), pages 793-811.
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.- Xiang Li & Tianyu Zhang & Liang Wang & Hongguang Ma & Xiande Zhao, 2022. "A minimax regret model for the leader–follower facility location problem," Annals of Operations Research, Springer, vol. 309(2), pages 861-882, February.
- Martelli, Emanuele & Freschini, Marco & Zatti, Matteo, 2020. "Optimization of renewable energy subsidy and carbon tax for multi energy systems using bilevel programming," Applied Energy, Elsevier, vol. 267(C).
- Dempe, Stephan & Kalashnikov, Vyacheslav & Rios-Mercado, Roger Z., 2005. "Discrete bilevel programming: Application to a natural gas cash-out problem," European Journal of Operational Research, Elsevier, vol. 166(2), pages 469-488, October.
- Gentile, José & Alves Pessoa, Artur & Poss, Michael & Costa Roboredo, Marcos, 2018. "Integer programming formulations for three sequential discrete competitive location problems with foresight," European Journal of Operational Research, Elsevier, vol. 265(3), pages 872-881.
- Soyster, A.L. & Murphy, F.H., 2013. "A unifying framework for duality and modeling in robust linear programs," Omega, Elsevier, vol. 41(6), pages 984-997.
- Küçükaydin, Hande & Aras, Necati & Kuban AltInel, I., 2011. "Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution," European Journal of Operational Research, Elsevier, vol. 208(3), pages 206-220, February.
- 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.
- Wen, U. P. & Huang, A. D., 1996. "A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 563-571, February.
- H. C. Wu, 2010. "Duality Theory for Optimization Problems with Interval-Valued Objective Functions," Journal of Optimization Theory and Applications, Springer, vol. 144(3), pages 615-628, March.
- Liu, Shaonan & Kong, Nan & Parikh, Pratik & Wang, Mingzheng, 2023. "Optimal trauma care network redesign with government subsidy: A bilevel integer programming approach," Omega, Elsevier, vol. 119(C).
- 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.
- Losada, Chaya & Scaparra, M. Paola & O’Hanley, Jesse R., 2012. "Optimizing system resilience: A facility protection model with recovery time," European Journal of Operational Research, Elsevier, vol. 217(3), pages 519-530.
- 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.
- Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
- Wu, Hsien-Chung, 2009. "The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions," European Journal of Operational Research, Elsevier, vol. 196(1), pages 49-60, July.
- A. K. Bhurjee & G. Panda, 2016. "Sufficient optimality conditions and duality theory for interval optimization problem," Annals of Operations Research, Springer, vol. 243(1), pages 335-348, August.
- Tolga H. Seyhan & Lawrence V. Snyder & Ying Zhang, 2018. "A New Heuristic Formulation for a Competitive Maximal Covering Location Problem," Transportation Science, INFORMS, vol. 52(5), pages 1156-1173, October.
- Zaharias Xanthopulos & Emanuel Melachrinoudis & Marius M. Solomon, 2000. "Interactive Multiobjective Group Decision Making with Interval Parameters," Management Science, INFORMS, vol. 46(12), pages 1585-1601, December.
- Blom, Danny & Smeulders, Bart & Spieksma, Frits, 2024. "Rejection-proof mechanisms for multi-agent kidney exchange," Games and Economic Behavior, Elsevier, vol. 143(C), pages 25-50.
- Mintz, Yonatan & Aswani, Anil & Kaminsky, Philip & Flowers, Elena & Fukuoka, Yoshimi, 2023. "Behavioral analytics for myopic agents," European Journal of Operational Research, Elsevier, vol. 310(2), pages 793-811.
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:wly:navres:v:39:y:1992:i:3:p:419-435. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.