Multiple Objective Linear Programming and the Tradeoff — Compromise Set

In this paper, we develop a method for finding all nondominated compromise solutions to a multiple objective linear program. We also develop an iterative technique that yields an interesting subset of the nondominated set termed the tradeoff — compromise set. This subset depends on the ideal vector and gives insight into what tradeoffs are possible amongst the objectives.