### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 265-284 |

Number of pages | 20 |

Journal | Mathematical Programming |

Volume | 48 |

Issue number | 1-3 |

DOIs | |

State | Published - Mar 1 1990 |

### All Science Journal Classification (ASJC) codes

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints'. Together they form a unique fingerprint.

## Cite this

Friesz, T. L., Tobin, R. L., Cho, H. J., & Mehta, N. J. (1990). Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints.

*Mathematical Programming*,*48*(1-3), 265-284. https://doi.org/10.1007/BF01582259