Robust network optimization under polyhedral demand uncertainty is NPNP-hard

Minimum cost network design/dimensioning problems where feasibility has to be ensured w.r.t. a given (possibly infinite) set of scenarios of requirements form an important subclass of robust LPLP problems with right-hand side uncertainty. Such problems arise in many practical contexts such as Telecommunications, logistic networks, power distribution networks, etc. Though some evidence of the computational difficulty of such problems can be found in the literature, no formal NP-hardness proof was available up to now. In the present paper, this pending complexity issue is settled for all robust network optimization problems featuring polyhedral demand uncertainty, both for the single-commodity and multicommodity case, even if the corresponding deterministic versions are polynomially solvable as regular (continuous) linear programs. A new family of polynomially solvable instances is also discussed.