Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming |
| |
Authors: | Benson H P |
| |
Institution: | (1) Warrington College of Business Administration, University of Florida, Gainesville, Florida |
| |
Abstract: | Various difficulties have been encountered in using decision set-based vector maximization methods to solve a multiple-objective linear programming problem (MOLP). Motivated by these difficulties, Benson recently developed a finite, outer-approximation algorithm for generating the set of all efficient extreme points in the outcome set, rather than in the decision set, of problem (MOLP). In this article, we show that the Benson algorithm also generates the set of all weakly efficient points in the outcome set of problem (MOLP). As a result, the usefulness of the algorithm as a decision aid in multiple objective linear programming is further enhanced. |
| |
Keywords: | Multiple-objective linear programming efficient sets weakly efficient sets outer-approximation algorithms |
本文献已被 SpringerLink 等数据库收录! |
|