Skip to main content
SpringerLink
Log in

Global solution of nonlinear mixed-integer bilevel programs

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

An algorithm for the global optimization of nonlinear bilevel mixed-integer programs is presented, based on a recent proposal for continuous bilevel programs by Mitsos et al. (J Glob Optim 42(4):475–513, 2008). The algorithm relies on a convergent lower bound and an optional upper bound. No branching is required or performed. The lower bound is obtained by solving a mixed-integer nonlinear program, containing the constraints of the lower-level and upper-level programs; its convergence is achieved by also including a parametric upper bound to the optimal solution function of the lower-level program. This lower-level parametric upper bound is based on Slater-points of the lower-level program and subsets of the upper-level host sets for which this point remains lower-level feasible. Under suitable assumptions the KKT necessary conditions of the lower-level program can be used to tighten the lower bounding problem. The optional upper bound to the optimal solution of the bilevel program is obtained by solving an augmented upper-level problem for fixed upper-level variables. A convergence proof is given along with illustrative examples. An implementation is described and applied to a test set comprising original and literature problems. The main complication relative to the continuous case is the construction of the parametric upper bound to the lower-level optimal objective value, in particular due to the presence of upper-level integer variables. This challenge is resolved by performing interval analysis over the convex hull of the upper-level integer variables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alefeld G., Mayer G.: Interval analysis: theory and applications. J. Comput. Appl. Math. 121(1-2), 421–464 (2000)

    Article  Google Scholar 

  2. Bank B., Guddat J., Klatte D., Kummer B., Tammer K.: Non-Linear Parametric Optimization. Birkhäuser Verlag, Stuttgart (1983)

    Google Scholar 

  3. Bard J.F.: An algorithm for solving the general bilevel programming problem. Math. Oper. Res. 8(2), 260–272 (1983)

    Article  Google Scholar 

  4. Bard J.F.: Practical Bilevel Optimization: Algorithms and Applications. Nonconvex Optimization and Its Applications. Kluwer, Dordrecht (1998)

    Google Scholar 

  5. Bhattacharjee B., Lemonidis P., Green W.H. Jr, Barton P.I.: Global solution of semi-infinite programs. Math. Program. Ser. B 103(2), 283–307 (2005)

    Article  Google Scholar 

  6. Blankenship J.W., Falk J.E.: Infinitely constrained optimization problems. J. Optim. Theory Appl. 19(2), 261–281 (1976)

    Article  Google Scholar 

  7. Bracken J., McGill J.T.: Mathematical programs with optimization problems in constraints. Oper. Res. 21(1), 37–44 (1973)

    Article  Google Scholar 

  8. Brooke A., Kendrick D., Meeraus A.: GAMS: A User’s Guide. Scientific, Redwood City (1988)

    Google Scholar 

  9. Dempe S.: Foundations of Bilevel Programming. Nonconvex Optimization and its Applications. Kluwer, Dordrecht (2002)

    Google Scholar 

  10. Dempe S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52(3), 333–359 (2003)

    Article  Google Scholar 

  11. Edmunds T.A., Bard J.F.: An algorithm for the mixed-integer nonlinear bilevel programming problem. Ann. Oper. Res. 34(1), 149–162 (1992)

    Article  Google Scholar 

  12. Falk J.E., Hoffman K.: A nonconvex max- min problem. Naval Res. Logist. 24(3), 441–450 (1977)

    Article  Google Scholar 

  13. Floudas C.A., Stein O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18(4), 1187–1208 (2007)

    Article  Google Scholar 

  14. Fortuny-Amat J., McCarl B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32(9), 783–792 (1981)

    Google Scholar 

  15. Glover F.: Improved linear integer programming formulations of nonlinear integer programs. Manag. Sci. 22(4), 455–460 (1975)

    Article  Google Scholar 

  16. Glover F., Woolsey E.: Further reduction of zero-one polynomial programming problems to zero-one linear programming problems. Oper. Res. 21(1), 156–161 (1973)

    Article  Google Scholar 

  17. Grossmann I.E., Halemane K.P.: Decomposition strategy for designing flexible chemical-plants. AIChE J. 28(4), 686–694 (1982)

    Article  Google Scholar 

  18. Gümüs Z.H., Floudas C.A.: Global optimization of mixed-integer bilevel programming problems. Comput. Manag. Sci. 2(3), 181–212 (2005)

    Article  Google Scholar 

  19. Jan R.H., Chern M.S.: Nonlinear integer bilevel programming. Eur. J. Oper. Res. 72(3), 574–587 (1994)

    Article  Google Scholar 

  20. Kesavan P., Allgor R.J., Gatzke E.P., Barton P.I.: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs. Math. Program. 100(3), 517–535 (2004)

    Article  Google Scholar 

  21. Lemonidis, P., Barton, P.I.: Interval methods for generalized semi-infinite programs. International conference on parametric optimization and related topics (PARAOPT VIII), Cairo, Egypt, 27 Nov 2005–1 Dec 2005

  22. Mitsos A., Lemonidis P., Barton P.I.: Global solution of bilevel programs with a nonconvex inner program. J. Glob. Optim. 42(4), 475–513 (2008)

    Article  Google Scholar 

  23. Mitsos A., Lemonidis P., Lee C.K., Barton P.I.: Relaxation-based bounds for semi-infinite programs. SIAM J. Optim. 19(1), 77–113 (2008)

    Article  Google Scholar 

  24. Moore R.: Methods and Applications of Interval Analysis. SIAM, Philadelphia (1979)

    Google Scholar 

  25. Moore J.T., Bard J.F.: The mixed integer linear bilevel programming problem. Oper. Res. 38(5), 911–921 (1990)

    Article  Google Scholar 

  26. Oluwole O.O., Bhattacharjee B., Tolsma J.E., Barton P.I., Green W.H. Jr: Rigorous valid ranges for optimally reduced kinetic models. Combustion Flame 146(1–2), 348–365 (2006)

    Article  Google Scholar 

  27. Sahin K.H., Ciric A.R.: A dual temperature simulated annealing approach for solving bilevel programming problems. Comput. Chem. Eng. 23(1), 11–25 (1998)

    Article  Google Scholar 

  28. Sahinidis, N., Tawarmalani M.: BARON. http://www.gams.com/solvers/baron.pdf (2005)

  29. Shimizu K., Ishizuka Y., Bard F.J.: Nondifferentiable and Two-Level Mathematical Programming. Kluwer, Boston (1997)

    Google Scholar 

  30. Stein O., Still G.: Solving semi-infinite optimization problems with interior point techniques. SIAM J. Control Optim. 42(3), 769–788 (2003)

    Article  Google Scholar 

  31. Stein O., Oldenburg J., Marquardt W.: Continuous reformulations of discrete-continuous optimization problems. Comput. Chem. Eng. 28(10), 1951–1966 (2004)

    Article  Google Scholar 

  32. Tawarmalani M., Sahinidis N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Nonconvex Optimization and its Applications. Kluwer, Boston (2002)

    Google Scholar 

  33. Thirwani D., Arora S.R.: An algorithm for the integer linear fractional bilevel programming problem. Optimization 39, 53–67 (1997)

    Article  Google Scholar 

  34. Vicente L.N., Calamai P.H.: Bilevel and multilevel programming—a bibliography review. J. Glob. Optim. 5(3), 291–306 (1994)

    Article  Google Scholar 

  35. Ye J.J.: Constraint qualifications and KKT conditions for bilevel programming problems. Math. Oper. Res. 31(4), 811–824 (2006)

    Article  Google Scholar 

  36. Zuhe S., Neumaier A., Eiermann M.C.: Solving minimax problems by interval-methods. BIT 30(4), 742–751 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aachen Institute for Advanced Study in Computational Engineering Science, RWTH Aachen, Pauwelsstr. 12, 52074, Aachen, Germany

    Alexander Mitsos

Authors
  1. Alexander Mitsos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Mitsos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitsos, A. Global solution of nonlinear mixed-integer bilevel programs. J Glob Optim 47, 557–582 (2010). https://doi.org/10.1007/s10898-009-9479-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-009-9479-y

Keywords

Search

Navigation