Hausdorff methods for approximating the convex Edgeworth–Pareto hull in integer problems with monotone objectives
- 30 Downloads
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.
Keywordsadaptive methods polyhedral approximation convergence rate multiobjective optimization Pareto frontier integer optimization
Unable to display preview. Download preview PDF.
- 4.M. Ehrgott and X. Gandibleux, “An annotated bibliography of multiobjective combinatorial optimization,” Tech. Rep. No. 62 (Wirtschaftsmathematik, 2000).Google Scholar
- 6.X. Gandibleux and K. Klamroth, “Cardinality bounds for multiobjective knapsack problems,” Tech. Rep. (Inst. of Appl. Math., Univ. Erlangen-Nuremberg, Germany, 2006).Google Scholar
- 8.D. Schweigert, Vector-weighted matchings, Combinatorics Advances, Ed. by C. Colbourn and E. Mahmoodian (Kluwer Academic, Dordrecht, 1995), pp. 267–276.Google Scholar
- 16.P. S. Aleksandrov, A. I. Markushevich, and A. Ya. Khinchin, Encyclopedia of Elementary Mathematics, Book 5: Geometry (Nauka, Moscow, 1966) [in Russian].Google Scholar
- 17.D. V. Gusev and A. V. Lotov, “Models, systems, and decisions,” Operations Research, Ed. by Yu. P. Ivanilov (Vychisl. Tsentr Ross. Akad. Nauk, Moscow, 1994) [in Russian].Google Scholar