DETERMINATION OF THE EFFICIENT SET IN MULTIOBJECTIVE LINEAR-PROGRAMMING

被引：53

作者：

ARMAND, P

MALIVERT, C

机构：

[1] Départment de Mathématiques, Faculté des Sciences, Université de Limoges, Limoges

来源：

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1991年 / 70卷 / 03期

关键词：

MULTIOBJECTIVE LINEAR PROGRAMMING; EFFICIENT POINTS; NONDOMINATED FACES; DEGENERACY;

D O I：

10.1007/BF00941298

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：467 / 489

页数：23

共 18 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

[Anonymous], 2003, LINEAR PROGRAMMING

[3] FINDING AN INITIAL EFFICIENT EXTREME POINT FOR A LINEAR MULTIPLE OBJECTIVE PROGRAM [J].