An approach to postoptimality and sensitivity analysis of zero‐one goal programs

In this article we present a methodology for postoptimality and sensitivity analysis of zero‐one goal programs based on the set of k‐best solutions. A method for generating the set of k‐best solutions using a branch and bound algorithm and an implicit enumeration scheme for multiple objective problem are discussed. Rules for determining the range of parameter changes that still allows a member of the k‐best set to be optimal are developed. An investigation of a sufficient condition for postoptimality analysis is also presented.