An Algorithm for Multiple Compensatory Objectives Problems

This paper presents an efficient algorithm both in computation speed and storage requirement by exploring the special structure of problems involving multiple objective goals. The algorithm developed here is limited to the problems with multiple, compensatory objectives, however it can be extended to‘traditional’preemptive priority goat programming problems. Computational results are included.