A general convex duality turns the perturbed utility route choice maximization into an unconstrained concave problem whose solution recovers unique link flows via convex conjugates, enabling fast optimization and revealing a circuit analogy.
Using Lemma 2 and Rockafellar (1970, Theorem 5.7), we see that(TP*) is (also implicitly) unconstrained and involves maximization of a differentiable concave criterion function
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
econ.TH 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Convex Duality in Perturbed Utility Route Choice
A general convex duality turns the perturbed utility route choice maximization into an unconstrained concave problem whose solution recovers unique link flows via convex conjugates, enabling fast optimization and revealing a circuit analogy.