On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program |
| |
Authors: | Dauer Jerald P |
| |
Institution: | (1) Department of Mathematics, University of Tennessee at Chattanooga, 37403 Chattanooga, TN, USA |
| |
Abstract: | In this paper an algorithm is developed to generate all nondominated extreme points and edges of the set of objective values of a multiple objective linear program. The approach uses simplex tableaux but avoids generating unnecessary extreme points or bases of extreme points. The procedure is based on, and improves, an algorithm Dauer and Liu developed for this problem. Essential to this approach is the work of Gal and Kruse on the neighborhood problem of determining all extreme points of a convex polytope that are adjacent to a given (degenerate) extreme point of the set. The algorithm will incorporate Gal's degeneracy graph approach to the neighborhood problem with Dauer's objective space analysis of multiple objective linear programs. |
| |
Keywords: | Multiple objective linear program degeneracy collapsing objective space analysis |
本文献已被 SpringerLink 等数据库收录! |