Geodesic
Hausdorff methods for approximating the convex Edgeworth–Pareto hull in integer problems with monotone objectives
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 56 (2016) no. 8, pp. 1401-1415
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Adaptive methods for the polyhedral approximation of the convex Edgeworth–Pareto hull in multiobjective monotone integer optimization problems are proposed and studied. For these methods, theoretical convergence rate estimates with respect to the number of vertices are obtained. The estimates coincide in order with those for filling and augmentation $H$-methods intended for the approximation of nonsmooth convex compact bodies. 
@article{ZVMMF_2016_56_8_a3,
     author = {A. I. Pospelov},
     title = {Hausdorff methods for approximating the convex {Edgeworth{\textendash}Pareto} hull in integer problems with monotone objectives},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1401--1415},
     year = {2016},
     volume = {56},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_8_a3/}
}
TY  - JOUR
AU  - A. I. Pospelov
TI  - Hausdorff methods for approximating the convex Edgeworth–Pareto hull in integer problems with monotone objectives
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2016
SP  - 1401
EP  - 1415
VL  - 56
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_8_a3/
LA  - ru
ID  - ZVMMF_2016_56_8_a3
ER  - 
%0 Journal Article
%A A. I. Pospelov
%T Hausdorff methods for approximating the convex Edgeworth–Pareto hull in integer problems with monotone objectives
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2016
%P 1401-1415
%V 56
%N 8
%U http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_8_a3/
%G ru
%F ZVMMF_2016_56_8_a3
A. I. Pospelov. Hausdorff methods for approximating the convex Edgeworth–Pareto hull in integer problems with monotone objectives. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 56 (2016) no. 8, pp. 1401-1415. http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_8_a3/

[1] Sigal I. Kh., Melamed I. I., “Issledovanie lineinoi svertki kriteriev v mnogokriterialnom diskretnom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 35:8 (1995), 1260–1270 | MR | Zbl

[2] Sigal I. Kh., Melamed I. I., Teoriya i algoritmy resheniya mnogokriterialnykh zadach kombinatornoi optimizatsii, VTs RAN, M., 1996

[3] Sigal I. Kh., “Algoritmy dlya resheniya bikriterialnoi zadachi kommivoyazhera bolshoi razmernosti”, Zh. vychisl. matem. i matem. fiz., 34:1 (1994), 44–57 | MR | Zbl

[4] Ehrgott M., Gandibleux X., An annotated bibliography of multiobjective combinatorial optimization, Tech. Rept. 62, Wirtschaftsmathematik, 2000

[5] Sigal I. Kh., Melamed I. I., Vladimirova N. Yu., “Issledovanie lineinoi svertki kriteriev v bikriterialnoi zadache o rantse”, Zh. vychisl. matem. i matem. fiz., 39:5 (1999), 753–758 | MR | Zbl

[6] Gandibleux X., Klamroth K., Cardinality bounds for multiobjective knapsack problems, Tech. Rept., Inst. of Appl. Math., Univ. of Erlangen-Nuremberg, Germany, 2006

[7] Hamacher H. W., Pedersen C. R., Ruzika S., “Finding representative systems for discrete bicriteria optimization problems by box algorithms”, Operat. Res. Lett., 35 (2007), 336–344 | DOI | MR | Zbl

[8] Schweigert D., “Vector-weighted matchings”, Combinatorics Advances, eds. Colbourn C., Mahmoodian E., Kluwer Academic, Dordrecht, 1995, 267–276 | DOI | MR | Zbl

[9] Deb K., Multi-objective optimization using evolutionary algorithms, Wiley, Chichester, 2001 | MR | Zbl

[10] Evdokimov M. V., Mednitskii V. G., Sigal I. Kh., “Bikriterialnaya zadacha pereoborudovaniya proizvodstva”, Izv. RAN. Teoriya i sistemy upravleniya, 2001, no. 5, 90–96 | MR

[11] Pospelov A. I., “Approksimatsiya vypukloi obolochki Edzhvorta–Pareto v mnogokriterialnykh zadachakh s monotonnymi kriteriyami”, Zh. vychisl. matem. i matem. fiz., 49:10 (2009), 1765–1778 | MR | Zbl

[12] Kamenev G. K., Pospelov A. I., “Poliedralnaya approksimatsiya vypuklykh kompaktnykh tel metodami napolneniya”, Zh. vychisl. matem. i matem. fiz., 52:5 (2012), 818–828 | MR | Zbl

[13] Kamenev G. K., Optimalnye adaptivnye metody poliedralnoi approksimatsii vypuklykh tel, VTs RAN, M., 2007

[14] Leikhtveis K., Vypuklye mnozhestva, Nauka, M., 1985

[15] Gruber P. M., Convex and discrete geometry, Springer, New York, 2007 | MR | Zbl

[16] Aleksandrov P. S., Markushevich A. I., Khinchin A. Ya., Entsiklopediya elementarnoi matematiki, v. 5, Geometriya, Nauka, M., 1966

[17] Gusev D. V., Lotov A. V., “Modeli, sistemy, resheniya”, Issledovanie operatsii, ed. Ivanilov Yu. P., VTs RAN, M., 1994, 15–43

[18] Bushenkov V. A., Gusev D. I., Kamenev G. K., “Vizualizatsiya mnozhestva Pareto v mnogomernoi zadache vybora”, Dokl. AN, 335:5 (1994), 567–569 | Zbl

[19] Lotov A. V., Bushenkov V. A., Kamenev G. K., Interactive Decision Maps. Approximation and Visualization of Pareto frontier, Kluwer, Boston, 2004 | MR | Zbl

[20] Preparata F., Sheimos M., Vychislitelnaya geometriya: vvedenie, Mir, M., 1989

[21] Lotov A. V., Bourmistrova L. V., Efremov R. V., Bushenkov V. A., Brainin N. A., Buber A. L., “Experience of model integration and Pareto frontier visualization in the search for preferable water quality strategies”, Environmental Modelling and Doftware, 20:2 (2005), 243–260 | DOI | MR