@article {IOPORT.05998425,
    author       = {Noghin, V.D. and Baskov, O.V.},
    title        = {Pareto set reduction based on an arbitrary finite collection of numerical information on the preference relation.},
    year         = {2011},
    journal      = {Doklady Mathematics},
    volume       = {83},
    number       = {3},
    issn         = {1064-5624},
    pages        = {418-420},
    publisher    = {Maik Nauka/Interperiodica, Moscow; Pleiades Publishing, New York; Springer, Secaucus, NJ},
    doi          = {10.1134/S1064562411030288},
    abstract     = {Summary: We propose two universal algorithms (methods) based on taking into account an arbitrary finite collection of information quanta for Pareto set reduction. The first (geometric) algorithm was developed by the first author. It involves the solution of the convex analysis problem posed in [{\it V. D. Noghin}, Decision making in multicriteria environment: a quantitative approach. Moscow: Fizmatlit (2005)]. The second (algebraic) algorithm was developed by the second author. It sequentially takes into account the available collection of quanta on the basis of the linear operator used to take into account one quantum in Theorem 3.5 from [loc. cit.].},
    identifier   = {05998425},
}