Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
DOI10.1007/BF01582259zbMath0723.90070OpenAlexW2057039020MaRDI QIDQ2276884
Roger L. Tobin, Terry L. Friesz, Hsun-Jung Cho, Nihal J. Mehta
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582259
heuristic algorithmsbilevel programminghierarchical mathematical programmingequilibrium network design
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical programming (90C99)
Related Items (55)
Cites Work
- Unnamed Item
- Unnamed Item
- Sensitivity analysis for variational inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Derivative evaluation and computational experience with large bilevel mathematical programs
- An efficient dual approach to the urban road network design problem
- Network design problem with congestion effects: A case of bilevel programming
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- Sensitivity Analysis for Equilibrium Network Flow
- Projected Newton Methods for Optimization Problems with Simple Constraints
This page was built for publication: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints