A general method for determining the set of all efficient solutions to a linear vectormaximum problem

[1]  George D. Frazier,et al.  Applying a Model of Organization Structure to the Analysis of a Wood Products Market , 1966 .

[2]  Stanley Zionts,et al.  Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems , 1966 .

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

[4]  Werner Dinkelbach,et al.  Sensitivitätsanalysen und parametrische Programmierung , 1969 .

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

[6]  Tomas Gal,et al.  Homogene mehrparametrische lineare Programmierung , 1972, Z. Oper. Research.

[7]  T. Gál,et al.  Multiparametric Linear Programming , 1972 .

[8]  S. Zionts.  Some Empirical Tests of the Criss-Cross Method , 1972 .

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

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

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

[12]  Joseph G. Ecker,et al.  Finding efficient points for linear multiple objective programs , 1975, Math. Program..

[13]  Tomas Gal.  Zur Identifikation redundanter Nebenbedingungen in linearen Programmen , 1975, Z. Oper. Research.

[14]  Tomas Gal,et al.  Redundant objective functions in linear vector maximum problems and their determination , 1977 .

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