, Volume 48, Issue 1-3, pp 265-284

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

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper we 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. We obtain derivative information needed to implement these algorithms for such bilevel problems from the theory of sensitivity analysis for variational inequalities. We provide computational results for several numerical examples.