Abstract
A two-person, noncooperative game in which the players move in sequence can be modeled as a Bilevel Programming Problem (BLPP). In this chapter, a global optimization approach to BLPP is considered via a reverse convex transformation and the use of dominant cuts and an exact penalty function. Mathematical programs of this type arise in connection with policy problems such as environmental economics issues. Numerical examples illustrating the proposed method and its performance on variety of test problems are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M.A. Amouzegar and S.E. Jacobsen. Analysis of mathematical modeling methods for regional hazardous waste management. Technical Report ENG-95–147, Optimization and Communications Systems Laboratory, Department of Electrical Engineering, University of California, Los Angeles, 1994.
G. Anandalingam and D. White. A solution method for the linear static Stackelberg problem using penalty functions. IEEE Transactions on Automatic Control, 35:1170–1173, 1990.
J. Bard and J. Moore. A branch and bound algorithm for the bilevel programming problem. SIAM Journal on Scientific and Statistical Computing, 11:281–292, 1990.
J. F. Bard. Regulating non-nuclear industrial waste by hazard classification. Journal of Environmental Systems, 13:21–41, 1983/84.
J. F. Bard. Convex two level programming. Mathematical Programming, 40:15–27, 1988.
M. Bazaraa, H. Sherali, and C.M. Shetty. Nonlinear Programming: Theory and Algorithms. J. Wiley, New York, 1993.
W. F. Bialas and M. H. Karwan. On two-level optimization. IEEE Transactions on Automatic Control, AC-27(1):211–214,1982.
W. F. Bialas and M. H. Karwan. Two-level linear programming Management Science, 30(8):1004–1020,1984.
P. H. Calamai and L. N. Vicente. Generating linear and linear-quadratic bilevel programming problems. SIAM Journal of Scientific Computing, 14(4):770–782, 1994.
W. Candler and R. Norton. Multilevel programming and development policy. Technical Report 258, World Bank Staff, Washington D.C., 1977.
W. Candler and R. Townsley. A linear two-level programming problem. Computers and Operations Research, 9(1):59–76, 1982.
J. Fortuny-Amat and B. McCarl. A representation and economic interpretation of a two-level programming problem. Journal of the Operational Research Society, 32:783–792, 1981.
P. Hansen, B. Jaumard, and G. Savard. New branch and bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13(5):1194–1217, 1992.
R. Horst and H. Thy. Global Optimization. Springer-Verlag, Berlin, 1993.
S. E. Jacobsen and K. Moshirvaziri. Computational experience using an edge search algorithm for linear reverse convex programs. Journal of Global Optimization, 9(2), 1996.
P. Marcotte. Network optimization with continuous control parameters. Transportation Science, 17:181–197, 1983.
T. Miller, T. Friesz, and R. Tobin. Heuristic algorithms for delivered price spatially competitive network facility location problems. Annals of Operations Research, 34:177–202, 1992.
K. Moshirvaziri and M.A. Amouzegar. MATLAB linear programming tool for use in global optimization algorithms. Technical Report ENG-95–146, Optimization and Communications Systems Laboratory, Department of Electrical Engineering, University of California, Los Angeles, 1994.
K. Moshirvaziri, M.A. Amouzegar, and S.E. Jacobsen. Test problem construction for linear bilevel programming problems. Journal of Global Optimization, 8(3):235–243, 1996.
S. Suh and T. Kim. Solving nonlinear bilevel programming models of the equilibrium network design problem: a comparative review. Annals of Operations Research, 34:203–218, 1992.
N.V. Thoung and H. Thy. A Finite Algorithm for Solving Linear Programs with an Additional Reverse Convex Constraint, volume 255 of Lecture Notes in Economics and Mathematical Systems, pages 291–302. Springer-Verlag, 1985.
H. Thy. Concave programming under linear constraints. Soviet Mathematics, 5:1437–1440, 1964.
L. N. Vicente and P. H. Calamai. Bilevel and multilevel programming A bibliography review. Journal of Global Optimization, 5(3), 1994.
H. von Stackelberg. The Theory of the Market Economy. William Hodge and Company Limited, London, 1952.
D. White and G. Anandalingam. A penalty function approach for solving bi-level linear programs. Journal of Global Optimization, 3:397–419, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Kluwer Academic Publishers
About this chapter
Cite this chapter
Amouzegar, M., Moshirvaziri, K. (1998). A Penalty Method for Linear Bilevel Programming Problems. 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_11
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0307-7_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7989-8
Online ISBN: 978-1-4613-0307-7
eBook Packages: Springer Book Archive