Goal programming and pareto efficiency

This paper examines the concepts of detection and restoration of pareto efficiency to pareto inefficient goal programmes. An overview of the subject is given and pareto efficiency is defined in terms of objectives, priority levels, and the overall model. The concept of pareto unboundedness is introduced. Simplex-based methods for efficient detection of inefficiency and unboundedness are given. Two new methods for restoration, based on perference information given by the decision maker are detailed. The performance of these techniques is analysed on a set of goal programmes.