Determination of the efficient set in multiobjective linear programming |
| |
Authors: | P. Armand C. Malivert |
| |
Affiliation: | (1) Départment de Mathématiques, Faculté des Sciences, Université de Limoges, Limoges, France |
| |
Abstract: | This paper develops a method for finding the whole set of efficient points of a multiobjective linear problem. Two algorithms are presented; the first one describes the set of all efficient vertices and all efficient rays of the constraint polyhedron, while the second one generates the set of all efficient faces. The method has been tested on several examples for which numerical results are reported.The authors are grateful to Professor W. Stadler and an anonymous referee for their helpful comments and corrections. |
| |
Keywords: | Multiobjective linear programming efficient points non-dominated faces degeneracy |
本文献已被 SpringerLink 等数据库收录! |