zbMATH — the first resource for mathematics

PAINT: Pareto front interpolation for nonlinear multiobjective optimization. (English) Zbl 1259.90119
Summary: A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g. for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive method is fast with the surrogate problem even though the problem is computationally expensive. Numerical examples of applying the PAINT method for interpolation are included.

90C29 Multi-objective and goal programming
Full Text: DOI
[1] Barber, C.B., Dobkin, D.P., Huhdanpää, H.: The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 469–483 (1996) · Zbl 0884.65145 · doi:10.1145/235815.235821
[2] Bezerkin, V.E., Kamenev, G.K., Lotov, A.V.: Hybrid adaptive methods for approximating a nonconvex multidimensional Pareto frontier. Comput. Math. Math. Phys. 46, 1918–1931 (2006) · doi:10.1134/S096554250611008X
[3] Brown, K.Q.: Voronoi diagrams from convex hulls. Inf. Process. Lett. 9, 223–228 (1979) · Zbl 0424.68036 · doi:10.1016/0020-0190(79)90074-7
[4] Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: IEEE International Conference on E-Commerce Technology, vol. 1, pp. 825–830 (2002)
[5] Eaton, J.W.: GNU Octave Manual. Network Theory Limited (2002)
[6] Edelsbrunner, H., Mücke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9, 66–104 (1990) · Zbl 0732.68099 · doi:10.1145/77635.77639
[7] Efremov, R.V., Kamenev, G.K.: Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems. Ann. Oper. Res. 166, 271–279 (2009) · Zbl 1163.90801 · doi:10.1007/s10479-008-0418-y
[8] Eskelinen, P., Miettinen, K., Klamroth, K., Hakanen, J.: Pareto navigator for interactive nonlinear multiobjective optimization. OR Spektrum 32, 211–227 (2010) · Zbl 1181.90237 · doi:10.1007/s00291-008-0151-6
[9] Goel, T., Vaidyanathan, R., Haftka, R.T., Shyy, W., Queipo, N.V., Tucker, K.: Response surface approximation of Pareto optimal front in multi-objective optimization. Comput. Methods Appl. Mech. Eng. 196, 879–893 (2007) · Zbl 1120.76358 · doi:10.1016/j.cma.2006.07.010
[10] Grünbaum, B.: Convex Polytopes. Interscience, London (1967)
[11] Hakanen, J., Miettinen, K., Sahlstedt, K.: Wastewater treatment: new insight provided by interactive multiobjective optimization. Decis. Support Syst. 51, 328–337 (2011) · Zbl 05883857 · doi:10.1016/j.dss.2010.11.026
[12] Hartikainen, M., Miettinen, K., Wiecek, M.M.: Constructing a Pareto front approximation for decision making. Math. Methods Oper. Res. 73, 209–234 (2011) · Zbl 1216.49002 · doi:10.1007/s00186-010-0343-0
[13] Hartikainen, M., Miettinen, K., Wiecek, M.M.: Pareto front approximations for decision making with inherent non-dominance. In: Shi, Y., Wang, S., Kou, G., Wallenius, J. (eds.) New State of MCDM in the 21st Century, Selected Papers of the 20th International Conference on Multiple Criteria Decision Making 2009, pp. 35–46. Springer, Berlin (2011) · Zbl 1229.90178
[14] Hasenjäger, M., Sendhoff, B.: Crawling along the Pareto front: tales from the practice. In: The 2005 IEEE Congress on Evolutionary Computation (IEEE CEC 2005), pp. 174–181. IEEE Press, Piscataway (2005)
[15] Hwang, C., Masud, A.S.M.: Multiple Objective Decision Making–Methods and Applications: a State-of-the-Art Survey. Springer, Berlin (1979) · Zbl 0397.90001
[16] Kamenev, G.K.: Study of an adaptive single-phase method for approximating the multidimensional Pareto frontier in nonlinear systems. Comput. Math. Math. Phys. 49, 2103–2113 (2009) · doi:10.1134/S0965542509120100
[17] Keeney, R.L.: Value-Focused Thinking: a Path to Creative Decisionmaking. Harward University Press, Harward (1996)
[18] Laukkanen, T., Tveit, T.-M., Ojalehto, V., Miettinen, K., Fogelholm, C.-J.: An interactive multi-objective approach to heat exchanger network synthesis. Comput. Chem. Eng. 34, 943–952 (2010) · doi:10.1016/j.compchemeng.2010.01.002
[19] Lotov, A.V., Bushenkov, V.A., Kamenev, G.A.: Interactive Decision Maps. Kluwer Academic, Boston (2004) · Zbl 1103.90054
[20] Luque, M., Ruiz, F., Miettinen, K.: Global formulation for interactive multiobjective optimization. OR Spektrum 33, 27–48 (2011) · Zbl 1231.90238 · doi:10.1007/s00291-008-0154-3
[21] Martin, J., Bielza, C., Insua, D.R.: Approximating nondominated sets in continuous multiobjective optimization problems. Nav. Res. Logist. 52, 469–480 (2005) · Zbl 1072.90033 · doi:10.1002/nav.20090
[22] McMullen, P.: The maximum number of faces of a convex polytope. Mathematika 17, 179–184 (1970) · Zbl 0217.46703 · doi:10.1112/S0025579300002850
[23] Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic, Boston (1999) · Zbl 0949.90082
[24] Miettinen, K.: IND-NIMBUS for demanding interactive multiobjective optimization. In: Trzaskalik, T. (ed.) Multiple Criteria Decision Making’05, pp. 137–150. The Karol Adamiecki University of Economics in Katowice, Katowice (2006)
[25] Miettinen, K., Mäkelä, M.: Interactive bundle-based method for nondifferentiable multiobjective optimization: NIMBUS. Optimization 34, 231–246 (1995) · Zbl 0855.90114 · doi:10.1080/02331939508844109
[26] Miettinen, K., Mäkelä, M.M.: On scalarizing functions in multiobjective optimization. OR Spektrum 24, 193–213 (2002) · Zbl 1040.90037 · doi:10.1007/s00291-001-0092-9
[27] Miettinen, K., Mäkelä, M.M.: Synchronous approach in interactive multiobjective optimization. Eur. J. Oper. Res. 170, 909–922 (2006) · Zbl 1091.90071 · doi:10.1016/j.ejor.2004.07.052
[28] Miettinen, K., Ruiz, F., Wierzbicki, A.P.: Introduction to multiobjective optimization: interactive approaches. In: Branke, J., Deb, K., Miettinen, K., Slowinski, R. (eds.) Multiobjective Optimization: Interactive and Evolutionary Approaches, pp. 27–57. Springer, Berlin (2008)
[29] Monz, M.: Pareto navigation–algorithmic foundation of interactive multi-criteria IMRT planning. PhD thesis, University of Kaiserslautern (2006)
[30] Ruzika, S., Wiecek, M.M.: Approximation methods in multiobjective programming. J. Optim. Theory Appl. 126, 473–501 (2005) · Zbl 1093.90057 · doi:10.1007/s10957-005-5494-4
[31] Sindhya, K., Deb, K., Miettinen, K.: Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm. Nat. Comp. (to appear). doi: 10.1007/s11047-011-9250-4 · Zbl 1251.90358
[32] Viennet, R., Fonteix, C., Marc, I.: Multicriteria optimization using a genetic algorithm for determining a Pareto set. Int. J. Syst. Sci. 27, 255–260 (1996) · Zbl 0844.90079 · doi:10.1080/00207729608929211
[33] Wierzbicki, A.P.: On the completeness and constructiveness of parametric characterizations to vector optimization problems. OR Spektrum 8, 73–87 (1986) · Zbl 0592.90084 · doi:10.1007/BF01719738
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.