Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints

In this paper the authors consider heuristic algorithms for a special case of the generalized bilevel mathematical programming problem in which one of the levels is represented as a variational inequality problem. Such problems arise in network design and economic planning. The authors obtain derivative information needed to implement these algorithms for such bilevel problems from the theory of sensitivity analysis for variational inequalities. They provide computational results for several numerical examples.