Skip to main content
SpringerLink
Log in

Global solution of bilevel programs with a nonconvex inner program

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

Abstract

A bounding algorithm for the global solution of nonlinear bilevel programs involving nonconvex functions in both the inner and outer programs is presented. The algorithm is rigorous and terminates finitely to a point that satisfies ε-optimality in the inner and outer programs. For the lower bounding problem, a relaxed program, containing the constraints of the inner and outer programs augmented by a parametric upper bound to the parametric optimal solution function of the inner program, is solved to global optimality. The optional upper bounding problem is based on probing the solution obtained by the lower bounding procedure. For the case that the inner program satisfies a constraint qualification, an algorithmic heuristic for tighter lower bounds is presented based on the KKT necessary conditions of the inner program. The algorithm is extended to include branching, which is not required for convergence but has potential advantages. Two branching heuristics are described and analyzed. Convergence proofs are provided and numerical results for original test problems and for literature examples are presented.

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

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Bertsekas D.P. (1999). Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, Massachusetts

    Google Scholar 

  • Bertsimas D. and Tsitsiklis J.N. (1997). Introduction to Linear Optimization. Athena Scientific, Belmont, Massachusetts

    Google Scholar 

  • Bhattacharjee B., Barton P.I. and Green W.H. Jr. (2005). Interval methods for semi-infinite programs. Comput. Optim. Appl. 30(1): 63–93

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  • Brooke A., Kendrick D. and Meeraus A. (1988). GAMS: A User’s Guide. The Scientific Press, Redwood City, California

    Google Scholar 

  • Calamai P.H. and Vicente L.N. (1993). Generating linear and linear-quadratic bilevel programming-problems. SIAM J. Sci. Comput. 14(4): 770–782

    Article  Google Scholar 

  • Calamai P.H. and Vicente L.N. (1994). Generating quadratic bilevel programming test problems. ACM Trans. Math. Software 20(1): 103–119

    Article  Google Scholar 

  • Calamai P.H., Vicente L.N. and Judice J.J. (1993). A new technique for generating quadratic-programming test problems. Math. Program. 61(2): 215–231

    Article  Google Scholar 

  • Colson, B.: BIPA (Bilevel programming with approximation methods): Software guide and test problems, Technical Report CRT-2002-38. Technical Report, Centre de Recherche sur les Transports, Université de Montréal, Montréal, QC, Canada (2002)

  • Colson B., Marcotte P. and Savard G. (2005). A trust-region method for nonlinear bilevel programming: Algorithm and computational experience. Comput. Optim. Appl. 30(3): 211–227

    Article  Google Scholar 

  • Dempe S. (2002). Foundations of Bilevel Programming. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

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

    Article  Google Scholar 

  • Edmunds T.A. and Bard J.F. (1991). Algorithms for nonlinear bilevel mathematical programs. IEEE Trans. Syst. Man Cybernet. 21(1): 83–89

    Article  Google Scholar 

  • Falk J.E. and Hoffman K. (1997). A nonconvex max-min problem. Naval Res. Logist. 24(3): 441–450

    Google Scholar 

  • Falk J.E. and Liu J.M. (1995). On bilevel programming, part I: general nonlinear cases. Math.Program. 70(1): 47–72

    Article  Google Scholar 

  • Floudas C.A., Gümüs Z.H. and Ierapetritou M.G. (2001). Global optimization in design under uncertainty: feasibility test and flexibility index problems. Indust. Eng. Chem. Res. 40(20): 4267–4282

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  • Grossmann I.E. (2002). Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3(3): 227–252

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Gümüs Z.H. and Floudas C.A. (2001). Global optimization of nonlinear bilevel programming problems. J. Glob. Optim. 20(1): 1–31

    Article  Google Scholar 

  • Horst R. (1988). Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization, reverse convex constraints, DC-programming and Lipschitzian optimization. J. Optim. Theo Appl. 58(1): 11–37

    Article  Google Scholar 

  • Horst R. and Tuy H. (1996). Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin

    Google Scholar 

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

    Article  Google Scholar 

  • Kesavan P. and Barton P.I. (2000). Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems. Comput. Chem. Eng. 24(2–7): 1361–1366

    Article  Google Scholar 

  • Lemonidis, P., Barton, P.I.: Global solution of generalized semi-infinite programs (In preparation)

  • Lemonidis, P., Barton, P.I.: Interval methods for generalized semi-infinite programs. In: International Conference on Parametric Optimization and Related Topics (PARAOPT VIII), Cairo, Egypt, Nov. 27–Dec. 1 2005

  • Mitsos, A.: Man-Portable power generation devices: product design and supporting algorithms, http://yoric.mit.edu/download/Reports/MitsosThesis.pdf. PhD thesis, Massachusetts Institute of Technology (2006)

  • Mitsos, A., Barton, P.I.: Issues in the development of global optimization algorithms for bilevel programs with a nonconvex inner program. Technical Report, Massachusetts Institute of Technology (2006)

  • Mitsos, A., Barton, P.I.: A test set for bilevel programs, http://yoric.mit.edu/download/Reports/bileveltestset.pdf. Technical Report, Massachusetts Institute of Technology (2006)

  • Mitsos, A., Lemonidis, P., Lee, C.K., Barton, P.I.: Relaxation-based bounds for semi-infinite programs. SIAM J. Optim. (SIOPT), Accepted for publication (2007)

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

    Article  Google Scholar 

  • Moore R. (1979). Methods and Applications of Interval Analysis. SIAM, Philadelphia, PA

    Google Scholar 

  • Nemhauser G.L. and Wolsey L.A. (1999). Integer and Combinatorial Optimization. Wiley-Interscience, New York

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  • Tolsma J. and Barton P.I. (2000). DAEPACK: an open modeling environment for legacy models. Indust. Eng. Chem. Res. 39(6): 1826–1839

    Article  Google Scholar 

  • Tuy H., Migdalas A. and Hoai-Phuong N.T. (2007). A novel approach to bilevel nonlinear programming. J. Glob. Optim. 38(4): 527–554

    Article  Google Scholar 

  • Tuy H., Migdalas A. and Varbrand P. (1993). A global optimization approach for the linear 2-level program. J. Glob. Optim. 3(1): 1–23

    Article  Google Scholar 

  • Tuy H., Migdalas A. and Varbrand P. (1994). A quasi-concave minimization method for solving linear 2-level programs. J. Glob. Optim. 4(3): 243–263

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Williams H.P. (1990). Model Building in Mathematical Programming, 3rd edn. John Wiley and Sons, Chichester

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Chemical Engineering, Massachusetts Institute of Technology, 66-464, 77 Massachusetts Avenue, Cambridge, MA, 02139, USA

    Alexander Mitsos, Panayiotis Lemonidis & Paul I. Barton

Authors
  1. Alexander Mitsos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panayiotis Lemonidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul I. Barton
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paul I. Barton.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitsos, A., Lemonidis, P. & Barton, P.I. Global solution of bilevel programs with a nonconvex inner program. J Glob Optim 42, 475–513 (2008). https://doi.org/10.1007/s10898-007-9260-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-007-9260-z

Keywords

Search

Navigation