The compromise hypersphere for multiobjective linear programming

Abstract For a linear-programming problem with q (⩾2) objective functions (that is, a multiobjective linear-programming problem), we propose a method for ranking the full set or a subset of efficient extreme-point solutions. The idea is to enclose the given efficient solutions, as represented by q-dimensional points in objective space, within an annulus of minimum width, where the width is determined by a hypersphere that minimizes the maximum deviation of the points from the surface of the hypersphere. We argue that the hypersphere represents a surface of compromise and that the point closest to its surface should be considered as the “best” compromise efficient solution. Also, given a ranked (sub)set of efficient solutions, a procedure is given that associates to each efficient solution a set of q positive weights that causes the efficient solution to be optimal with respect to the given set of efficient solutions.

[1]  C. Romero,et al.  Multiple Criteria Decision Making and its Applications to Economic Problems , 1998 .

[2]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[3]  Alistair B. Forbes,et al.  Algorithms for geometric tolerance assessment. , 1994 .

[4]  S. Zionts,et al.  An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions , 1983 .

[5]  Peter Nijkamp,et al.  Multidimensional Spatial Data and Decision Analysis. , 1980 .

[6]  Moshe Dror,et al.  Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives , 1987 .

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

[8]  Tetsuzo Tanino,et al.  Sensitivity Analysis in MCDM , 1999 .

[9]  D. Bartholomew,et al.  Linear Programming: Methods and Applications , 1970 .

[10]  Ching-Lai Hwang,et al.  Multiple Attribute Decision Making: Methods and Applications - A State-of-the-Art Survey , 1981, Lecture Notes in Economics and Mathematical Systems.

[11]  Andrzej P. Wierzbicki,et al.  Reference Point Approaches , 1999 .

[12]  Saul I. Gass,et al.  Fitting Circles and Spheres to Coordinate Measuring Machine Data , 1998 .

[13]  S. Zionts,et al.  An Interactive Programming Method for Solving the Multiple Criteria Problem , 1976 .

[14]  P. Yu,et al.  The set of all nondominated solutions in linear cases and a multicriteria simplex method , 1975 .

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

[16]  Milan Zelany,et al.  A concept of compromise solutions and the method of the displaced ideal , 1974, Comput. Oper. Res..

[17]  G. W. Evans,et al.  An Overview of Techniques for Solving Multiobjective Mathematical Programs , 1984 .

[18]  Ralph E. Steuer,et al.  A revised simplex method for linear multiple objective programs , 1973, Math. Program..

[19]  S. C. Huang,et al.  Note on the mean-square strategy for vector-valued objective functions , 1972 .

[20]  R. Benayoun,et al.  Linear programming with multiple objective functions: Step method (stem) , 1971, Math. Program..

[21]  Faryar Etesami,et al.  Tolerance verification through manufactured part modeling , 1988 .

[22]  Donald W. Hearn,et al.  Efficient Algorithms for the (Weighted) Minimum Circle Problem , 1982, Oper. Res..

[23]  Utpal Roy,et al.  Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error , 1992, Comput. Aided Des..

[24]  A. Smilde,et al.  Multicriteria decision making , 1992 .

[25]  Saul I. Gass,et al.  Encyclopedia of Operations Research and Management Science , 1997 .

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

[27]  J. Ringuest.  Multiobjective Optimization: Behavioral and Computational Considerations , 1992 .

[28]  Hong Qiao,et al.  Analysis of two-dimensional measurement data for automated inspection , 1990 .

[29]  Ralph E. Steuer.  Sausage Blending Using Multiple Objective Linear Programming , 1984 .

[30]  W. R. Buckland,et al.  Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. , 1952 .

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

[32]  M. Zeleny.  Linear Multiobjective Programming , 1974 .

[33]  Ching-Lai Hwang,et al.  Fuzzy Multiple Attribute Decision Making - Methods and Applications , 1992, Lecture Notes in Economics and Mathematical Systems.

[34]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

[36]  P. Yu.  A Class of Solutions for Group Decision Problems , 1973 .