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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The dual of the traffic assignment problem with elastic demands


    Beteiligte:
    Carey, Malachy (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    15.06.1984


    Format / Umfang :

    11 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    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