Discrete linear bilevel programming problem
- 490 Downloads
In this paper, we analyze some properties of the discrete linear bilevel program for different discretizations of the set of variables. We study the geometry of the feasible set and discuss the existence of an optimal solution. We also establish equivalences between different classes of discrete linear bilevel programs and particular linear multilevel programming problems. These equivalences are based on concave penalty functions and can be used to design penalty function methods for the solution of discrete linear bilevel programs.
Key WordsLinear bilevel programming integer linear programming exact penalty functions
Unable to display preview. Download preview PDF.
- 4.Bard, J., andMoore, J.,The Mixed Integer Linear Bilevel Programming Problem, Operations Research, Vol. 38, pp. 911–921, 1990.Google Scholar
- 7.Edmunds, T., andBard, J.,Algorithms for Nonlinear Bilevel Mathematical Programming, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, pp. 83–89, 1991.Google Scholar
- 8.Luenberger, D.,Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1989.Google Scholar