Abstract
The bilevel programming problem involves two optimization problems where the data of the first one is implicitly determined by the solution of the second. In this paper, we introduce two descent methods for a special instance of bilevel programs where the inner problem is strictly convex quadratic. The first algorithm is based on pivot steps and may not guarantee local optimality. A modified steepest descent algorithm is presented to overcome this drawback. New rules for computing exact stepsizes are introduced and a hybrid approach that combines both strategies is discussed. It is proved that checking local optimality in bilevel programming is a NP-hard problem.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Anandalingam, G., andFriesz, T., Editors,Hierarchical Optimization, Annals of Operations Research, Vol. 34, 1992.
Bard, J., andMoore, J.,A Branch-and-Bound Algorithm for the Bilevel Programming Problem, SIAM Journal on Scientific and Statistical Computing, Vol. 11, pp. 281–292, 1990.
Hansen, P., Jaumard, B., andSavard, G.,New Branching-and-Bounding Rules for Linear Bilevel Programming, SIAM Journal on Statistical and Scientific Computing, Vol. 13, pp. 1194–1217, 1992.
Júdice, J., andFaustino, A.,A Sequential LCP Method for Bilevel Linear Programming, Annals of Operations Research, Vol. 34, pp. 89–106, 1992.
Al-Khayyal, F., Horst, R., andPardalos, P.,Global, Optimization of Concave Functions Subject of Quadratic Constraints: An Application in Nonlinear Bilevel Programming, Annals of Operations Research, Vol. 34, pp. 125–147, 1992.
Bard, J.,Convex Two-Level Programming, Mathematical Programming, Vol. 40, pp. 15–27, 1988.
Edmunds, T., andBard, J.,Algorithms for Nonlinear Bilevel Mathematical Programs, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, pp. 83–89, 1991.
Jaumard, B., Savard, G., andXiong, J.,An Exact Algorithm for Convex Bilevel Programming, Optimization Days, Montreal, Canada, 1992.
Aiyoshi, E., andShimizu, K.,Hierarchical Decentralized System and Its New Solution by a Barrier Method, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 11, pp 444–449, 1981.
Aiyoshi, E., andShimizu, K.,A Solution Method for the Static Constrained Stackelberg Problem via Penalty Method, IEEE Transactions on Automatic Control, Vol. 29, pp. 1111–1114, 1984.
Bi, Z., Calamai, P., andConn, A.,An Exact Penalty Function Approach for the Nonlinear Bilevel Programming Problem, Technical Report 180-O-170591, University of Waterloo, 1991.
Ishizuka, Y., andAiyoshi E.,Double Penalty Method for Bilevel Linear Programming, Annals of Operations Research, Vol. 34, pp. 73–88, 1992.
Florian, M., andChen, Y.,A Bilevel Programming Approach to Estimating O-D Matrix by Traffic Counts, Report CRT-750, Centre de Recherche sur les Transports, 1991.
Kolstad, C., andLasdon, L.,Derivative Evaluation and Computational Experience with Large Bilevel Mathematical Programs, Journal of Optimization Theory and Applications, Vol. 65, pp. 485–499, 1990.
Bard, J.,Optimality Conditions for the Bilevel Programming Problem, Naval Research Logistics Quarterly, Vol. 31, pp. 13–26, 1984.
Clarke, P., andWesterberg, A.,A Note of the Optimality Conditions for the Bilevel Programming Problem, Naval Research Logistics, Vol. 35, pp. 413–418, 1988.
Chen, Y., andFlorian, M.,The Nonlinear Bilevel Programming Problem: A General Formulation and Optimality Conditions, Report CRT-794, Centre de Recherche sur les Transports, 1991.
Dempe, S.,A Necessary and a Sufficient Optimality Condition for Bilevel Programming Problems, Optimization (to appear).
Gauvin, J., andSavard, G.,The Steepest-Descent Method for the Nonlinear Bilevel Programming Problem, Report G-90-37, GERAD (Groupe d'Études et de Recherche en Analyse des Décisions), 1990.
Júdice, J., andFaustino, A.,The Linear-Quadratic Bilevel Programming Problem, INFOR (to appear).
Al-Khayyal, F.,An Implicit Enumeration Procedure for the General Linear Complementarity Problem, Mathematical Programming Studies, Vol. 31, pp. 1–20, 1987.
Kojima, M., Mizuno, S., andYoshise, A.,A Polynomial-Time Algorithm for a Class of Linear Complementarity Problems, Mathematical Programming, Vol. 50, pp. 331–342, 1991.
Murty, K.,Linear Programming, John Wiley and Sons, New York, 1983.
Megiddo, N.,On Finding Primal and Dual Optimal Bases, ORSA Journal on Computing, Vol. 3, pp. 63–65, 1991.
Pardalos, P., andSchnitger, G.,Checking Local Optimality in Constrained Quadratic Programming is NP-Hard, Operations Research Letters, Vol. 7, pp. 33–35, 1988.
Carpenter, T., Lustig, I., Mulvey, J., andShanno, D.,Higher-Order Predictor-Corrector Interior-Point Methods with Application to Quadratic Objectives, RUTCOR Research Report RRR 67-90, Rutgers University, 1990.
Garey, M., andJohnson, D.,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, New York, 1979.
Author information
Authors and Affiliations
Additional information
Communicated by R. Sargent
Support of this work has been provided by INIC (Portugal) under Contract 89/EXA/5, by FCAR (Québec), and by NSERC and DND-ARP (Canada).
Rights and permissions
About this article
Cite this article
Vicente, L., Savard, G. & Júdice, J. Descent approaches for quadratic bilevel programming. J Optim Theory Appl 81, 379–399 (1994). https://doi.org/10.1007/BF02191670
Issue Date:
DOI: https://doi.org/10.1007/BF02191670