A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems

This paper provides a direction based parameter dependent classical method to find entire Pareto set of multi-criteria optimization problems. Proposed method is non-gradient based and parameter of the technique essentially lies on the unit sphere in the criterion space. Sequentially solving a set of problems, corresponding to each particular parameter vector on the unit sphere, entire Pareto set of the problem is captured. It is obtained that the method bears a necessary and sufficient condition for Pareto optimality. It is also shown that a simple modification on the constraint set of the formulated problem can ensure general D-Pareto optimality of the outcome solutions, where D is any pointed convex cone. In specific, proposed method can extract 𝜖-Pareto optimal points. As at any 𝜖-Pareto point, trade-off between any two objectives are bounded, outcome solution set of the studied method can facilitate decision maker for final selection of solution. Proposed technique and its illustrations are supported by several numerical and pictorial representations.

[1]  Siegfried Helbig.  An interactive algorithm for nonlinear vector optimization , 1990 .

[2]  Gabriele Eichfelder,et al.  Adaptive Scalarization Methods in Multiobjective Optimization , 2008, Vector Optimization.

[3]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[4]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[5]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[6]  P. Serafini,et al.  Scalarizing vector optimization problems , 1984 .

[7]  Lotfi A. Zadeh,et al.  Optimality and non-scalar-valued performance criteria , 1963 .

[8]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[9]  Lakhmi C. Jain,et al.  Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[10]  Kishor S. Trivedi,et al.  Performability Analysis: Measures, an Algorithm, and a Case Study , 1988, IEEE Trans. Computers.

[11]  Kalyanmoy Deb,et al.  Finding Knees in Multi-objective Optimization , 2004, PPSN.

[12]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[13]  Indraneel Das.  On characterizing the “knee” of the Pareto curve based on Normal-Boundary Intersection , 1999 .

[14]  Kalyanmoy Deb,et al.  On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods , 2007, Eur. J. Oper. Res..

[15]  Achille Messac,et al.  Physical programming - Effective optimization for computational design , 1996 .

[16]  Masahiro Tanaka,et al.  GA-based decision support system for multicriteria optimization , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[17]  J. Dennis,et al.  A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems , 1997 .

[18]  Achille Messac,et al.  From Dubious Construction of Objective Functions to the Application of Physical Programming , 2000 .

[19]  A. Messac,et al.  The normalized normal constraint method for generating the Pareto frontier , 2003 .

[20]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[21]  S. Utyuzhnikov,et al.  Directed search domain: a method for even generation of the Pareto frontier in multiobjective optimization , 2011 .