Stability analysis for a special interval cutting problem

For a special cutting problem we show that it is possible to derive full information about the regions of stability of an optimal solution by a slight modification of a dynamic programming procedure used for solving the unperturbed problem. A simple algorithm for computing the optimal value function of this two-parametric discrete optimization problem will also be given. This algorithm is based on the dynamic programming idea too.