On the finite extension of the marginal function arising in decomposition algorithms

The authors consider the problem how a convex optimal-value function arising in primal decomposition can be finitely continued beyond its domain. By a suitable presentation of the exact penalty method an implementable continuation can be obtained which does not change the set of optimal solutions. If the problem has separability and partially linearity properties the authors manage to obtain a complete continuation of the optimal-value function.