Successive Convex Relaxation Approach to Bilevel Quadratic Optimization Problems
The bilevel quadratic optimization problem is an instance of a hierarchical decision process where the lower level constraint set is dependent on decisions taken at the upper level. By replacing the lower level problem by the corresponding KKT optimality condition, the entire problem is transformed into a single level yet non-convex quadratic optimization problem involving the complementarity condition. In this paper, we adopt the successive convex relaxation method given by Kojima and Tunçel for approximating a nonconvex feasible region. By further exploiting the special structure of the bilevel quadratic optimization problem, we present new techniques which enable the efficient implementation of the successive convex relaxation method for the problem. The performance of these techniques is tested in a number of problems, and compared with some other procedures.
KeywordsBilevel Programming Nonconvex Quadratic Program Semi-Infinite LP Relaxation Reformulation-Linearization Technique Lift-and-Project Procedure
Unable to display preview. Download preview PDF.
- M. Kojima, T. Matsumoto and M. Shida, “Moderate Nonconvex-ity = Convexity + Quadratic Concavity” Technical Report B-348, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo, Japan, March 1999, Revised April 1999.Google Scholar
- M. Kojima and A. Takeda, “Complexity analysis of successive convex relaxation methods for nonconvex sets,” Technical Report B-350, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo, Japan, April 1999. Revised July 1999.Google Scholar
- M. Kojima and L. Tunçel, “Cones of matrices and successive convex relaxations of nonconvex sets,” SIAM Journal on Optimization Vol.10, No. 3, 750–778.Google Scholar
- M. Kojima and L. Tunçel, “Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems,” to appear in Mathematical Programming.Google Scholar
- R. Horst and H. Tuy, Global Optimization, Second, Revised Edition, (Springer-Verlag, Berlin, 1992).Google Scholar
- N. V. Sahinidis, (1998), “BARON: Branch and reduce optimization navigator, User’s manual ver. 3.0”, Department of Chemical Engineering, University of Illinois at Urbana-Champaign.Google Scholar
- A. Takeda, Y. Dai, M. Fukuda, and M. Kojima, “Towards implementations of successive convex relaxation methods for nonconvex quadratic optimization problems,” in RM. Pardalos eds., Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, Kluwer Academic Press, 2000, pp.489–510.Google Scholar
- V. Visweswaran, C. A. Floudas, M. G. Ierapetritou and E. N. Pis-tikopoulos, (1996), “A decomposition-based global optimization approach for solving bilevel linear and quadratic programs,” in C. A. Floudas eds., State of the Art in Global Optimization, Kluwer, Dordrecht, 139–162.CrossRefGoogle Scholar