Article Outline
Keywords
Definitions
Theoretical Properties
Algorithmic Approaches
See also
References
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bard JF (1984) Optimality conditions for the bilevel programming problem. Naval Res Logist Quart 31:13–26
Bard JF, Falk JE (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9(1):77–100
Bard JF, Moore JT (1990) A branch and bound algorithm for the bilevel programming problem. SIAM J Sci Statist Comput 11(2):281–292
Bialas WF, Karwan MH (1984) Two-level linear programming. Managem Sci 30(8):1004–1020
Candler W, Townsely R (1982) A linear two-level programming problem. Comput Oper Res 9(1):59–76
Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Statist Comput 13(1):1194–1217
Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math Program 32:146–164
Shimizu K, Ishizuka Y, Bard JF (1997) Nondifferentiable and two-level mathematical programming. Kluwer, Dordrecht
Simaan M (1977) Stackelberg optimization of two-level systems. IEEE Trans Syst, Man Cybern SMC-7(4):554–556
White DJ, Anandalingam G (1993) A penalty function for solving bi-level linear programs. J Global Optim 3:397–419
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Bard, J.F. (2008). Bilevel Linear Programming . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_36
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_36
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering