A Decomposition-Based Global Optimization Approach for Solving Bilevel Linear and Quadratic Programs

  • V. Visweswaran
  • C. A. Floudas
  • M. G. Ierapetritou
  • E. N. Pistikopoulos
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 7)


The paper presents a decomposition based global optimization approach to bilevel linear and quadratic programming problems. By replacing the inner problem by its corresponding KKT optimality conditions, the problem is transformed to a single yet non-convex, due to the complementarity condition, mathematical program. Based on the primal-dual global optimization approach of Floudas and Visweswaran (1990, 1993), the problem is decomposed into a series of primal and relaxed-dual subproblems whose solutions provide lower and upper bounds to the global optimum. By further exploiting the special structure of the bilevel problem, new properties are established which enable the efficient implementation of the proposed algorithm. Computational results are reported for both linear and quadratic example problems.


Dual Problem Lagrange Function Primal Problem Bilevel Program Bilevel Program Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anandalingam G. and D.J. White (1990). A solution method for the Linear Static Stackelberg Problem Using Penalty Method.IEEE Trans. Aut. Control,35, 1170.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Aiyoshi, E and K. Shimizu (1981). Hierarchical Decentralized systems and its new solution by a Barrier Method.IEEE Trans. Systems, Man and Cybernetics,SMC-11, 444.MathSciNetGoogle Scholar
  3. 3.
    Aiyoshi, E and K. Shimizu (1984). A solution method for the Static Constraint Stackelberg Problem Via Penalty Method.IEEE Trans. Aut Control,AC-29. 1111.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Al-Khayyal F., R. Horst and P. Pardalos (1992). Global Optimization on Concave Functions Subject to Quadratic Constraints: An Application in nonlinear Bilevel Programming.Annals Oper. Res.,34, 125.MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Bard, J.F . (1983). An Algorithm for Solving the General Bilevel Programming Problem.Math. Oper. Res.,8, 260.MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Bard, J.F . (1984). Optimality Conditions for the Bilevel Programming Problem.Nav. Res. Log. Quart.,31, 13.MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Bard, J.F . (1988). Convex Two-Level Optimization.Math. Prog.,40, 15.MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Bard, J.F. and J.E. Falk (1982). An Explicit Solution to the Multi-Level programming Problem.Comp. Oper. Res.,9, 77.MathSciNetCrossRefGoogle Scholar
  9. 9.
    Bard, J.F. and J.T. Moore (1990). A Branch and Bound Algorithm for the Bilevel Programming Problem.SIAM J. Seien. Stat. Comp.,11, 281.MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Ben-Ayed O. and C. E. Blair (1989). Computational Difficulties of Bilivel Linear Programming.Oper. Res. Tech. Notes, 556.Google Scholar
  11. 11.
    Bialas, W.F. and M.H. Karwan (1984). Two-Level Linear Programming.Mang. Sci.,30. 1004.MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Candler, W. and R. Townsley (1982). A Linear Two-Level Programming Problem.Comp. Oper. Res.,9, 59.MathSciNetCrossRefGoogle Scholar
  13. 13.
    Clark, P.A. and A.W. Westerberg (1988). A Note on the Optimality Conditions for the Bilevel Programming Problem.Nav. Res. Log.,35, 413.MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Floudas, C.A. and V. Visweswaran (1990). A Global Optimization Algorithm (GOP) for Certain Classes of Nonconvex NLPs-I. Theory.Comput. Chem. Engng.,14, 1397.CrossRefGoogle Scholar
  15. 15.
    Floudas, C.A. and V. Visweswaran (1993). Primal-Relaxed Dual Global Optimization Approach.JOTA,78, 187.Google Scholar
  16. 16.
    Fortuny-Amat, J. and B. McCarl (1981). A representation and Economic Interpretation of a Two-Level Programming problem.J. Oper. Res. Soc.,32, 783.MathSciNetzbMATHGoogle Scholar
  17. 17.
    Hansen, P. B. Jaumard and G. Savard (1990). New Branching and Bounding Rules for Linear Bilevel Programming.SIAM J. Sei. Stat. Comp.Google Scholar
  18. 18.
    Haurie, A., G. Savard and D.J. White (1990). A Note on: An Efficient Point Algorithm For a Linear Two-Stage Optimization Problem.Oper. Res. Tech. Notes, 553.Google Scholar
  19. 19.
    Judice J.J. and A.M. Faustino (1992). A sequential LCP method for Bilevel Linear Programming.Annals Oper. Res.,34, 89.MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Shimizu, K. and E. Aiyoshi, E (1981). A New Computational Method for Stackelberg and Min-Max Problems by Use of a Penalty Method.IEEE Trans, on Aut Control,AC-26, 460.MathSciNetCrossRefGoogle Scholar
  21. 21.
    Tuy, H., A. Migdalas and P. Varbrand (1993a). A Global Optimization Approach for the Linear Two-Level Program.J. Global Opt.,3, 1.MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Tuy, H., A. Migdalas and P. Varbrand (1993b). A Quasiconcave Minimization Method for Solving Linear Two-Level Programs.J. Global Opt.,4, 243.MathSciNetCrossRefGoogle Scholar
  23. 23.
    White D.J. and G. Anandalingam (1993). A Penalty Function Approach for Solving Bi-Level Linear Programs.J. Global Opt.,3, 397.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • V. Visweswaran
    • 1
    • 2
  • C. A. Floudas
    • 1
  • M. G. Ierapetritou
    • 3
  • E. N. Pistikopoulos
    • 3
  1. 1.Department of Chemical EngineeringPrinceton UniversityPrincetonUSA
  2. 2.Mobil Research and Development CorporationPenningtonUSA
  3. 3.Centre for Process Systems Engineering, Department of Chemical EngineeringImperial CollegeLondonUK

Personalised recommendations