Decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-727743

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.