Linear two-level programming deals with optimization problems in which the constraint region is implicity determined by another optimization problem. Mathematical programs of this type arise in connection with policy problems to which the Stackelberg leader-follower game is applicable. In this paper, the linear two-level programming problem is restated as a global optimization problem and a new solution method based on this approach is developed. The most important feature of this new method is that it attempts to take full advantage of the structure in the constraints using some recent global optimization techniques. A small example is solved in order to illustrate the approach.
This is a preview of subscription content, access via your institution.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Al-Khayyal, F. A., R. Horst, and P. M. Pardalos (1991), Global Optimization of Concave Functions Subject to Quadratic Constraints Is in an Application in Nonlinear Bilevel Programming, forthcoming inAnals of Oper. Res.
Bard, J. F. and J. E. Falk (1982), An Explicit Solution to the Multi-Level Programming Problem,Comput. & Ops. Res. 9(1), 77–100.
Bard, J. F. (1983), An Algorithm for Solving the General Bi-Level Programming Problem,Math, of Ops. Res. 8(2), 260–272.
Moore, J. T. and J. F. Bard (1990), The Mixed Integer Linear Bilevel Programming Problem,Ops. Res. 38(5), 911–921.
Bialas, W. F. and M. H. Karwan (1982), On Two-Level Optimization,IEEE Trans. Auto. Cont. AC-27(1), 211–214.
Blundet, W. R. and J. A. Black (1984),The Land-Use/Transport System, 2nd Edition, Pergamon Press, Australia.
Candler, W. and R. Townsley (1982), A Linear Two-Level Programming Problem,Comput. & Ops. Res. 9(1), 59–76.
Fortuny-Amat, J. and B. McCarl (1981), A Representation of a Two-Level Programming Problem,J. Ops. Res. Soc. 32, 783–792.
Hansen, P., B. Jaumard, and G. Savard (1990), New Branching and Bounding Rules for Linear Bilievel Programming, forthcoming inSIAM Journal on Scientific and Statistical Computing.
Hillestad, R. J. and S. E. Jacobsen (1980), Linear Programs with an Additional Reverse Convex Constraint,Applied Mathematics and Optimization 6, 257–269.
Horst, R., N. V. Thoai, and J. de Vries (1988), On Finding New Vertices and Redundant Constraints in Cutting Plane Algorithms for Global Optimization,Operations Research Letters 7, 85–90.
Horst, R. and H. Tuy (1990),Global Optimization: Deterministic Approach, Springer Verlag, Berlin.
Kolstad, C. D. and L. S. Lasdon (1986),Derivative Evaluation and Computational Experience with Large Bi-level Mathematical Programs, Faculty Working Paper No. 1266, College of Commerce and Business Administration, University of Illinois at Urbana-Champaign.
Loridan, P. and J. Morgan (1989), New Results of Approximate Solutions in Two-Level Optimization,Optimization 20(6), 819–836.
Muu, L. D. (1985), A Convergent Algorithm for Solving Linear Programs with an Additional Reverse Convex Constraint,Kybernetica 21, 428–435.
Rockafellar, R. T. (1970),Convex Analysis, Princeton Univ. Press.
von Stackelberg, H. (1952),The Theory of the Market Economy, William Hodge and Company Limited, London.
Thuong, N. V. and H. Tuy (1984), A Finite Algorithm for Solving Linear Programs with an Additional Reverse Convex Constraint,Lecture Notes in Economics and Mathematical Systems 225, 291–302.
Tuy, H. (1990), Polyhedral Annexation Method for Concave Minimization, in Leifman, Lev. J. and J. B. Rosen (eds.),Functional Analysis, Optimization and Mathematical Economics, Oxford University Press, New York, 248–260.
Tuy, H. (1991), Effect of Subdivision Strategy on Convergence and Efficiency of Some Global Optimization Algorithms,Journal of Global Optimization 1(1), 23–36.
Tuy, H. (1991), Polyhedral Annexation, Dualization and Dimension Reduction Technique in Global Optimization,Journal of Global Optimization 1(3), 229–244.
Ünlü, G. (1987), A Linear Bi-Level Programming Algorithm Based on Bicriteria Programming,Comput. Ops. Res. 14(2), 173–179.
Wen, U.-P. and S.-T. Hsu (1989), A Note on a Linear Bilevel Programming Algorithm Based on Bicriteria Programming,Comput. & Ops. Res. 16(1), 79–83.
The paper was completed while this author was visiting the Department of Mathematics of Linköping University.
Rights and permissions
About this article
Cite this article
Tuy, H., Migdalas, A. & Värbrand, P. A global optimization approach for the linear two-level program. J Glob Optim 3, 1–23 (1993). https://doi.org/10.1007/BF01100237
- Linear two-level program
- global optimization
- Stackelberg game
- reverse convex constraint programming
- polyhedral annexation method