Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space

摘要: 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 recent years have begun develop tools for analyzing and solving (MOLP) outcome space, rather than space. In this article, we present validate new hybrid approach The systematically integrates simplicial partitioning technique into an outer approximation procedure yield algorithm that generates the set of all efficient extreme points finite number iterations. Some key potential practical computational advantages are indicated.