论文信息 - Linear Multiple Objective Programming

Linear Multiple Objective Programming

Multiple objective optimisation has undergone considerable development in recent years and several approaches have been investigated. One of the closest to single objective optimisation is vector optimisation, in which efficient (non-dominated, admissible, Pareto optimal) solutions are sought. Since linear programming exhibits a particularly complete body of theory, we might expect the same to be true of vector linear programming and in this lecture we will describe some aspects of this theory.

Roger Hartley | R. Hartley

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

[2] J. G. Ecker,et al. On Computing an Initial Efficient Extreme Point , 1978 .

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

[4] R. Hartley. On Cone-Efficiency, Cone-Convexity and Cone-Compactness , 1978 .

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

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

[7] Joseph G. Ecker,et al. Finding all efficient extreme points for multiple objective linear programs , 1978, Math. Program..

[8] Gabriel R. Bitran,et al. Duality Based Characterizations of Efficient Facets , 1980 .

[9] W. Hogan. Point-to-Set Maps in Mathematical Programming , 1973 .

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

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