Approximating the noninferior set in multiobjective linear programming problems

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

[2]  Johan Philip,et al.  Algorithms for the vector maximization problem , 1972, Math. Program..

[3]  J. Focke,et al.  Vektormaximumproblem und parametrische optimierung , 1973 .

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

[5]  Heinz Isermann,et al.  Technical Note - Proper Efficiency and the Linear Vector Maximum Problem , 1974, Oper. Res..

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

[7]  Ralph E. Steuer.  Multiple Objective Linear Programming with Interval Criterion Weights , 1976 .

[8]  T. Gal.  A general method for determining the set of all efficient solutions to a linear vectormaximum problem , 1977 .

[9]  Heinz Isermann,et al.  The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program , 1977 .

[10]  J. Cohon,et al.  Generating multiobjective trade-offs: an algorithm for bicriterion problems , 1979 .

[11]  J. Ecker,et al.  Generating all maximal efficient faces for multiple objective linear programs , 1980 .

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

[13]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[14]  M. Dessouky,et al.  Estimates of the minimum nondominated criterion values in multiple-criteria decision-making , 1986 .

[15]  G. R. Reeves,et al.  Minimum values over the efficient set in multiple objective decision making , 1988 .

[16]  Ralph E. Steuer,et al.  Computational experience concerning payoff tables and minimum criterion values over the efficient set , 1988 .

[17]  Jared L. Cohon,et al.  Approximating the noninferior set in linear biobjective programs using multiparametric decomposition , 1989 .