Decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints

A mathematical programming problem with affine equilibrium constraints (AMPEC) is a bilevel programming problem where the lower one is a parametric affine variational inequality. We formulate some classes of bilevel programming in forms of MPEC. Then we use a regularization technique to formulate the resulting problem as a mathematical program with an additional constraint defined by the difference of two convex functions (DC function). A main feature of this DC decomposition is that the second component depends upon only the parameter in the lower problem. This property allows us to develop branch-and-bound algorithms for globally solving AMPEC where the adaptive rectangular bisection takes place only in the space of the parameter. As an example, we use the proposed algorithm to solve a bilevel Nash-Cournot equilibrium market model. Computational results show the efficiency of the proposed algorithm.

[1]  L. Muu,et al.  Optimization over equilibrium sets , 2001 .

[2]  Nguyen Dong Yen,et al.  Quadratic Programming and Affine Variational Inequalities: A Qualitative Study , 2005 .

[3]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[4]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[5]  H. P. Benson,et al.  Optimization over the efficient set , 1984 .

[6]  Descent methods for mixed variational inequalities in a Hilbert space , 2001 .

[7]  Vyacheslav V. Kalashnikov,et al.  Solving two-Level variational inequality , 1996, J. Glob. Optim..

[8]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[9]  Johan Philip,et al.  Algorithms for the vector maximization problem , 1972, Math. Program..

[10]  L. Muu,et al.  Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets , 2003 .

[11]  I. Konnov.  Combined Relaxation Methods for Variational Inequalities , 2000 .

[12]  J. Pang,et al.  Exact penalty for mathematical programs with linear complementarity constraints , 1997 .

[13]  P. Ánh,et al.  Lagrangian Duality Algorithms for Finding a Global Optimal Solution to Mathematical Programs with Affine Equilibrium Constraints , 2006 .

[14]  Le Dung Muu,et al.  A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems , 2003, J. Glob. Optim..

[15]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[16]  Le Thi Hoai An,et al.  Numerical solution for optimization over the efficient set by d.c. optimization algorithms , 1996, Oper. Res. Lett..

[17]  Masao Fukushima,et al.  A New Merit Function and a Successive Quadratic Programming Algorithm for Variational Inequality Problems , 1996, SIAM J. Optim..

[18]  S. Dempe.  Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints , 2003 .

[19]  Le Thi Hoai An,et al.  DC programming techniques for solving a class of nonlinear bilevel programs , 2009, J. Glob. Optim..

[20]  Akiko Yoshise,et al.  Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints , 2005 .