ISSN:
1436-4646
Keywords:
Variational inequalities
;
Benders decomposition
;
traffic assignment problem
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01582257
Permalink