Approximating the nondominated set of an MOLP by approximately solving its dual problem
The authors propose an algorithm to solve the dual multiobjective linear program approximately. By using a coupling function, they calculate a corresponding polyhedral set in the objective space of the primal multiobjective linear program. The approximate solution set can be proved to be an approximation of the weakly nondomimated set of the primal problem. This approximate method is applied to solve the bean intensity optimization problem of radiatherapy treatment planning.
scientific article; zbMATH DE number 5500940