Constrained optimization using multiple objective programming

In practical applications of mathematical programming it is frequently observed that the decision maker prefers apparently suboptimal solutions. A natural explanation for this phenomenon is that the applied mathematical model was not sufficiently realistic and did not fully represent all the decision makers criteria and constraints. Since multicriteria optimization approaches are specifically designed to incorporate such complex preference structures, they gain more and more importance in application areas as, for example, engineering design and capital budgeting. The aim of this paper is to analyze optimization problems both from a constrained programming and a multicriteria programming perspective. It is shown that both formulations share important properties, and that many classical solution approaches have correspondences in the respective models. The analysis naturally leads to a discussion of the applicability of some recent approximation techniques for multicriteria programming problems for the approximation of optimal solutions and of Lagrange multipliers in convex constrained programming. Convergence results are proven for convex and nonconvex problems.

[1]  Jared L. Cohon,et al.  Multiobjective programming and planning , 2004 .

[2]  Xavier Gandibleux,et al.  MultiObjective Programming and Goal Programming , 2003 .

[3]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[4]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[5]  T. Stewart.  A CRITICAL SURVEY ON THE STATUS OF MULTIPLE CRITERIA DECISION MAKING THEORY AND PRACTICE , 1992 .

[6]  Ralph E. Steuer,et al.  An interactive weighted Tchebycheff procedure for multiple objective programming , 1983, Math. Program..

[7]  G. K. Kamenev.  A class of adaptive algorithms for approximating convex bodies by polyhedra , 1992 .

[8]  Cláudia S. Sarrico,et al.  Data Envelopment Analysis: A Comprehensive Text with Models, Applications, References and DEA-Solver Software , 2001, J. Oper. Res. Soc..

[9]  Marek Makowski,et al.  Model-Based Decision Support Methodology with Environmental Applications , 2000 .

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

[11]  Bernard Roy,et al.  Problems and methods with multiple objective functions , 1971, Math. Program..

[12]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[13]  Alexander V. Lotov,et al.  Interactive Decision Maps: Approximation and Visualization of Pareto Frontier , 2004 .

[14]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

[15]  Johannes Jahn,et al.  On the connections between semidefinite optimization and vector optimization , 2003 .

[16]  Andrzej P. Wierzbick.  Basic properties of scalarizmg functionals for multiobjective optimization , 1977 .

[17]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[18]  Arthur M. Geoffrion,et al.  An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department , 1972 .

[19]  A. Wierzbicki.  On the completeness and constructiveness of parametric characterizations to vector optimization problems , 1986 .

[20]  Kathrin Klamroth,et al.  Norm-based approximation in multicriteria programming , 2002 .

[21]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.

[22]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[23]  Kathrin Klamroth,et al.  Unbiased approximation in multicriteria optimization , 2003, Math. Methods Oper. Res..

[24]  Simon French,et al.  Multiple Criteria Decision Making: Theory and Application , 1981 .

[25]  Jörg M. Wills,et al.  Handbook of Convex Geometry , 1993 .

[26]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[27]  P. Gruber.  Approximation of convex bodies , 1983 .

[28]  Marc Despontin,et al.  Multiple Criteria Optimization: Theory, Computation, and Application, Ralph E. Steuer (Ed.). Wiley, Palo Alto, CA (1986) , 1987 .

[29]  H. P. Benson,et al.  Existence of efficient solutions for vector maximization problems , 1978 .

[30]  Horst W. Hamacher,et al.  Finding Representative Systems for Discrete Bicriteria Optimization Problems by Box Algorithms , 2005 .

[31]  T. L. Saaty,et al.  The computational algorithm for the parametric objective function , 1955 .

[32]  V. Bowman.  On the Relationship of the Tchebycheff Norm and the Efficient Frontier of Multiple-Criteria Objectives , 1976 .

[33]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

[34]  G. K. Kamenev.  Analysis of an algorithm for approximating convex bodies , 1994 .

[35]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[36]  Kathrin Klamroth,et al.  Introducing oblique norms into multiple criteria programming , 2002, J. Glob. Optim..

[37]  Günter Rote,et al.  The convergence rate of the sandwich algorithm for approximating convex functions , 1992, Computing.

[38]  K. Holmberg.  Mean value cross decomposition applied to integer programming problems , 1997 .

[39]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[40]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[41]  Matthias Ehrgott,et al.  A discussion of scalarization techniques for multiple objective integer programming , 2006, Ann. Oper. Res..

[42]  JiGuan G. Lin.  On min-norm and min-max methods of multi-objective optimization , 2005, Math. Program..

[43]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[44]  Matthias Ehrgott,et al.  The Method of Elastic Constraints for Multiobjective Combinatorial Optimization and its Application in Airline Crew Scheduling , 2003 .

[45]  C. Coello,et al.  CONSTRAINT-HANDLING USING AN EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION TECHNIQUE , 2000 .

[46]  Horst W. Hamacher,et al.  Finding representative systems for discrete bicriterion optimization problems , 2007, Oper. Res. Lett..

[47]  A. M. Geoffrion.  Proper efficiency and the theory of vector maximization , 1968 .

[48]  Kathrin Klamroth,et al.  Norm-Based Approximation in Bicriteria Programming , 2001, Comput. Optim. Appl..

[49]  Patrick D. Surry,et al.  The COMOGA Method: Constrained Optimisation by Multi-Objective Genetic Algorithms , 1997 .