The dual of the traffic assignment problem with elastic demands

Malachy Carey

Transportation Research Part B: Methodological, 1985, vol. 19, issue 3, 227-237

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.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(85)90006-2
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:19:y:1985:i:3:p:227-237

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().