Benders decomposition for variational inequalities

The partitioning technique of J.F. Benders, which was generalized to nonlinear programming by Geoffrion, is further generalized to linearly constrained variational inequality problems. The conditions under which such a generalization is possible and appropriate are examined. An important area of application is the asymmetric traffic assignment problem for which the decomposition assumes a simple and effective form. A computational example demonstrates the algorithm.