Abstract This article is concerned with the dual of the traffic assignment problem, and of the combined generation, distribution, and assignment problem. The duals, and duality relations, for the arc-chain and node-arc formulations of the problem are derived using only the Kuhn-Tucker conditions for convex programs. This has the advantage of being more familiar to most readers than the conjugate function presentation which has been used elsewhere.
The dual of the traffic assignment problem with elastic demands
Transportation Research Part B: Methodological ; 19 , 3 ; 227-237
1984-06-15
11 pages
Article (Journal)
Electronic Resource
English
Equilibrium traffic assignment procedures with elastic demands
TIBKAT | 1976
|An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
British Library Online Contents | 2008
|An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
Online Contents | 2008
|Equilibrium Assignment Model with Uncertainties in Traffic Demands
Trans Tech Publications | 2012
|