Convex programming formulations of the asymmetric traffic assignment problem

Donald W. Hearn, Siriphong Lawphongpanich and Sang Nguyen

Transportation Research Part B: Methodological, 1984, vol. 18, issue 4-5, 357-365

Abstract: Recently introduced optimization formulations of the asymmetric traffic assignment problem are developed. The duality of two formulations is shown, and conditions for convexity and differentiability of the objective functions are given. Convexity conditions are also given for the family of formulations recently introduced by Smith (1983). When the travel cost vector is affine and monotone, all of the formulations are shown to be convex programming problems. Algorithmic implications of the results are discussed.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(84)90017-1
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:18:y:1984:i:4-5:p:357-365

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 ().