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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The dual of the traffic assignment problem with elastic demands


    Contributors:

    Published in:

    Publication date :

    1984-06-15


    Size :

    11 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands

    Babonneau, F. / Vial, J.-P. | British Library Online Contents | 2008



    Equilibrium Assignment Model with Uncertainties in Traffic Demands

    Kuang, Ai Wu ;Huang, Zhong Xiang | Trans Tech Publications | 2012