Skip to main content
SpringerLink
Log in

Complexity Issues in Bilevel Linear Programming

  • Chapter
Multilevel Optimization: Algorithms and Applications

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 20))

Abstract

In this chapter, we review some results with several co-authors for problems related to multiple level programming along three directions: complexity, polynomial algorithms for special cases, and potentially important application areas of multiple level programming techniques.

Formulating practical problems in multiple level programming may not always imply their solutions can be obtained efficiently. A major set-back in this direction is the work [26] of Jeroslow that bilevel linear programming can not be solved or even approximately solved in polynomial time unless NP = P (also see [23, 33] for discussion on computational complexity). An immediate question is that, under what conditions, and for what classes of problems, multiple level programs can be solved or be approximately solved in polynomial time. Positive results for this question have been very limited. Liu and Spencer have shown that the problem can be solved in polynomial time when the number of control variables of the followers is bounded by a constant [30]. Deng, Wang and Wang [20] have presented a much simpler proof which allows for an extension to cases where several independent followers are at the lower level. To another direction, it would be helpful to study useful application areas of the multiple level programming formulation. We discuss an emerging methodology for decision/computing under incomplete information, the competitive analysis method, and its formulation as multiple level programming We believe interplays of these two related disciplines will be fruitful and advantageous to both.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anandalingam, G. and Apprey, V., “Multi-level programming and conflict resolution”, European Journal of Operational Research 51, 1991, pp. 233–247.

    Article  MATH  Google Scholar 

  2. Anandalingam, G., and Friesz, T. L., (editors), Hierarchical Optimization, Annals of Operations Research 34 J.C. Baltzer Scientific Publishing Company, Basel, 1992.

    MATH  Google Scholar 

  3. Bagchi, A. “Stackelberg Differential Games in Economic Models”, Springer-Verlag, New York, 1984.

    Book  Google Scholar 

  4. Bard, J.F. and Falk, J.E., “An explicit solution to the multilevel programming problem”, Computers and Operations Research 9, 1982, pp. 77–100.

    Article  MathSciNet  Google Scholar 

  5. Bard, J.F. “An algorithm for solving the general bilevel programming program”, Mathematics of Operations Research 8, 1983, pp. 260–272.

    Article  MathSciNet  MATH  Google Scholar 

  6. Basar, T. and Cruz, J.B. “Concepts and methods in multi-person coordination and control”, Optimisation and Control of Dynamic Operational Research Models (edited by Tzafestas, S.G.), 1982, pp.351–394.

    Google Scholar 

  7. Ben-Ayed, O. “Bilevel linear programming”, Computers and Operations Research 20 1993, pp. 485–501.

    Article  MathSciNet  MATH  Google Scholar 

  8. Ben-Ayed, O., and Blair, C., “Computational difficulties of bilevel linear programming”, Operations Research 38 1990, pp. 556–560.

    Article  MathSciNet  MATH  Google Scholar 

  9. Bialas, W.F., and Karwan, M.H., “On two—level optimization”, IEEE Transactions on Automatic Control 27, 1982, pp. 211–214.

    Article  MATH  Google Scholar 

  10. Blair, C., “The computational complexity of multi-level linear programming”, Annals of Operations Research 34, 1992, pp. 13–19.

    Article  MathSciNet  MATH  Google Scholar 

  11. Bremner, A., “A policy analysis model based on multi—level programming”, Ph.D. thesis, Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Haifa, Israel, 1987.

    Google Scholar 

  12. Candler, W., and Townsley, R., “A linear two—level programming problem”, Computers and Operations Research 9, 1982, pp. 59–76.

    Article  MathSciNet  Google Scholar 

  13. Cassidy, R.G., Kirby, M.J.L., and Raike, W.M., “Efficient distribution of resources through three—levels of government”, Management Science 17, 1971, pp. 462–473.

    Article  Google Scholar 

  14. Dantzig, G.B., Linear Programming and Extensions, Princeton, Princeton University Press, 1963.

    MATH  Google Scholar 

  15. Dembo, R. S., and King, A. J., “Tracking Models and the Optimal Regret Distribution in Asset Allocation”, Applied Stochastic Models and Data Analysis 8, 1992, pp. 151–157.

    Article  Google Scholar 

  16. Deng, X., “Portfolio Management with Optimal Regret Ratio”, Proceedings of International Conference on Management Science and the Economic Development of China, Hong Kong, July, 1996, pp. 289–295.

    Google Scholar 

  17. Deng, X., and Papadimitriou, C. H., “ Competitive Distributed Decision-Making”, Algorithms,Software, Architecture, edited by J. van Leeuwen, Information Processing 92, Vol. I, Elsevier Science Publishers B.V., 1992, pp. 350–356. Journal version in Algorithmica 16 1996, pp.133–150.

    Google Scholar 

  18. Deng, X. and Papadimitriou, C.H., an unpublished manuscript.

    Google Scholar 

  19. Deng, X., and Papadimitriou, C.H., “On the Complexity of Cooperative Game Solution Concepts”, Mathematics of Operations Research, 19, 2, pp. 257–266, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  20. Deng, X., Wang, Q., and Wang, S., “ On The Complexity of Linear Bilevel Programming”, Proceedings of the first International Symposium on Operations Research with Applications, Beijing, China, 1995, pp. 205–212.

    Google Scholar 

  21. El-Yaniv, R., Fiat, A., Karp, R.M., and Turpin, G., “Competitive Analysis of Financial Games”, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992, pp. 327–333.

    Google Scholar 

  22. Fortuny-Amat, J. and McCarl, B. “A representation and economic interpretation of a two-level programming problem, ” Operational Research Society 32 1981, pp.783–792.

    MathSciNet  MATH  Google Scholar 

  23. Garey, M.R., and Johnson, D. S, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.

    MATH  Google Scholar 

  24. Hansen, P., Jaumard, B. and Savard, G. “A variable elimination algorithm for bilevel linear programming”, RUCTORS Research Report, Apri1,1990.

    Google Scholar 

  25. Hansen, P., Jaumard, B. and Savard, G. “New branch-and-bound rules for linear bilevel programming”, SIAM Journal on Scientific and Statistical Computing 13, 1992, pp. 1194–1217.

    Article  MathSciNet  MATH  Google Scholar 

  26. Jeroslow, R.G., “ The polynomial hierarchy and a simple model for competitive analysis”, Mathematical Programming, 1985, 32 pp. 14664.

    Article  MathSciNet  Google Scholar 

  27. Júdice, J.J. and Faustino, A.M. “The solution of the linear bilevel programming problem by using the linear complementarity problem”, InvestigaCa Operational 8, 1988, pp.77–95.

    Google Scholar 

  28. Khachian, L.G. “A polynomial algorithm for linear programming”, Doklady Akad. Nauk USSR, 244, no.5, 1979, pp. 1093–1096. Translated in Soviet Math. Doklady 20, pp. 191–194.

    Google Scholar 

  29. Lenstra, L.K., Rinnooy Kan, A.H.G., and Schrijver, A., History of Mathematical Programming, CWI North-Holland, Amsterdam, 1991.

    MATH  Google Scholar 

  30. Liu, Y. and Spencer, T. H., “Solving a bilevel linear program when the inner decision maker controls few variables”, European J. of Operational Research, 81, 1995, pp. 644–651.

    Article  MATH  Google Scholar 

  31. Markowitz, H.M., Portfolio Selection: Efficient Diversification of Investments, Wiley, New York, 1959.

    Google Scholar 

  32. Migdalas, A., and Pardalos, P.M., (editors), Special issue on Hierarchical and Bilevel Programming, Journal of Global Optimization 8(3) 1996.

    Google Scholar 

  33. Papadimitriou, C. H., Computational Complexity, Addison-Welsley Publishing Company, Don Mills, Ontario, 1994.

    MATH  Google Scholar 

  34. Papadimitriou, C. H., and Yannakakis, M. Optimization, Approximation, and Complexity Classes. J. of Computer and System Science, 43, pp. 425–440, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  35. Pardalos, P.M., Complexity in Numerical Optimization, World Scientific, 1993.

    Book  MATH  Google Scholar 

  36. Savage, L.J., “The Theory of Statistical Decision”, Journal of the American Statistical Association 46, 1951, pp. 55–67.

    Article  MATH  Google Scholar 

  37. Schrijver, A., Theory of Linear and Integer Programming, John Wiley & Sons, New York, 1986.

    MATH  Google Scholar 

  38. Shere, K., and Wingate, J., Allocation of resources to offensive strategic weapon systems, Navel Research Logistical Quarterly 23, 1976, pp. 85–93.

    Article  MathSciNet  MATH  Google Scholar 

  39. Simon, H., “Theories of Bounded Rationality”, in Decision and Organization, R. Radner (ed.), North Holland, 1972.

    Google Scholar 

  40. Sleator, D.D., and Tarjan, R.E., “Amortized efficiency of list update and paging rules”, Communications of the ACM 28, 1985, pp. 202–208.

    Article  MathSciNet  Google Scholar 

  41. Vicente, L.N., and Calamai, P.H., “Bilevel and multilevel programming: a bibliography review”, Journal of Global Optimization 5, 1994, pp. 291–306.

    Article  MathSciNet  MATH  Google Scholar 

  42. Wang, S., Wang, Q. and Romano-Rodriquez, S., “ Optimality conditions and an algorithm for linear—quadratic bilevel programs, ” Optimization 31, 1994, pp.127–139.

    Article  MathSciNet  MATH  Google Scholar 

  43. Wen, U.P. and Hsu, S.T. Linear bilevel programming problems—a review, Journal of Operational Research Society 42, 1991, pp. 123–133.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, York University, North York, Ontario, Canada, M3J 1P3

    Xiaotie Deng

Authors
  1. Xiaotie Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Optimization, Department of Mathematics, Linköping Institute of Technology, Linköping, Sweden

    Athanasios Migdalas  & Peter Värbrand  & 

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Kluwer Academic Publishers

About this chapter

Cite this chapter

Deng, X. (1998). Complexity Issues in Bilevel Linear Programming. In: Migdalas, A., Pardalos, P.M., Värbrand, P. (eds) Multilevel Optimization: Algorithms and Applications. Nonconvex Optimization and Its Applications, vol 20. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0307-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0307-7_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7989-8

  • Online ISBN: 978-1-4613-0307-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation