Convex programming, variational inequalities, and applications to the traffic equilibrium problem (Q1095795)

The problem of determining the equilibrium distribution of the traffic flow in a city network is studied when the traffic demands on a set of given routes are known. The problem is formulated in terms of nonlinear variational inequality over a polyhedron and a solution procedure is exhibited. This procedure is based on a very simple, necessary, and sufficient condition for a solution of the variational inequality to lie on a face of the polyhedron.