| Abstract: | The procedures for postoptimality analysis that are so much a part of linear programming studies have no simple counterparts in an integer programming context. In the case of Balas' Additive Algorithm, however, it would appear that the capacity of the technique to facilitate certain types of postoptimality analysis has not been fully exploited. This paper proposes an extension of the additive algorithm that utilizes insights generated while solving the original problem to do subsequent analysis upon it. In particular, procedures are developed for doing limited parameter ranging and for seeking new optima in light of parameter changes. |
