Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximating the nondominated set of an MOLP by approximately solving its dual problem
scientific article

    Statements

    Approximating the nondominated set of an MOLP by approximately solving its dual problem (English)
    0 references
    0 references
    0 references
    30 January 2009
    0 references
    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.
    0 references
    0 references
    Multiobjective linear programming
    0 references
    Geometric duality
    0 references
    \(\epsilon \)-nondominated set
    0 references
    Radiotheraphy treatment planning
    0 references
    0 references