Solving multiobjective programming problems by discrete representation

In the paper two theorems are given concerning the relationship between the conflict among the objectives and the nature of the Pareto set in vector optimization. Taking this into consideration, a method is developed which enables the author to find a determined number of points well dispersed over the Pareto set. He considers the application of this method for scanning the Pareto set in order to find a satisfying compromise. It can also be used for solving nonconvex and particularly for integer problems. Finally an example is given to demonstrate the method.