Finding Representative Nondominated Points in Multiobjective Linear Programming

In this paper we address the problem of finding well distributed nondominated points for an MOLP. We propose a method which combines the global shooting and normal boundary intersection methods. It overcomes the limitation of normal boundary intersection method that parts of the non-dominated set may be missed. We prove that this method produces evenly distributed nondominated points. Moreover, the coverage error and the uniformity level can be measured. Finally, we apply this method to an optimization problem in radiation therapy and show results for some clinical cases