Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space |
| |
Authors: | H P Benson |
| |
Institution: | (1) Warrington College of Business Administration, University of Florida, Gainesville, Florida |
| |
Abstract: | Various difficulties arise in using decision set-based vector maximization methods to solve a multiple-objective linear programming problem (MOLP). Motivated by these difficulties, some researchers in recent years have begun to develop tools for analyzing and solving problem (MOLP) in outcome space, rather than in decision space. In this article, we present and validate a new hybrid vector maximization approach for solving problem (MOLP) in outcome space. The approach systematically integrates a simplicial partitioning technique into an outer approximation procedure to yield an algorithm that generates the set of all efficient extreme points in the outcome set of problem (MOLP) in a finite number of iterations. Some key potential practical and computational advantages of the approach are indicated. |
| |
Keywords: | Multiple-objective linear programming vector maximization efficient set outcome set global optimization |
本文献已被 SpringerLink 等数据库收录! |