A wide range of transport bilevel problems are investigated referring to an elementary network consisting of one Origin Destination (OD) pair, with a given demenad, connected by two links. In this context it is shown that these problems generally non-convex, exhibit several local minima. Most results are supplied in a graphical form and analytical proofs are developed for the NDP with linear investment functions.
展开▼