Some remarks on inforation for partial and simultanious capacity expansions

We can make a difference between linear programming with partial and simulataneous capacity expansions. For the partial expansions it can be shown under some special conditions that the optimal shadow prices of an incomplete problem are dominating the optimal shadow prices of the complete form. The result indicates that under some special conditions we have to obserrve too hhigh optimal shadow prices caused by incomplete restrictive systems. In the case of simultanious expansions analogous reflections on optimal shadow prices are not possible, because the problem has to be solved by mixed-integer programming. However, by special indicators evaluations of expansions are possible.