Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem

In this paper we consider multi-stages traffic assignment with several demand layers, user types and network types. We consider two stages: demand matrix calculation (Entropy Wilson’s model) and traffic assignment models (Beckmann or Nesterov–de Palma). For the traffic assignment stage we use dual reformulation and combine these stages as a saddle-point problem (convex-concave). Then we discuss how one can solve this problem numerically.