A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program |
| |
| Institution: | 1. Institute of Neurological Sciences and Psychiatry, Hacettepe University, Ankara, Turkey;2. School of Medicine, Department of Psychiatry, Koç University & Research Center for Translational Medicine (KUTTAM), Koç University, İstanbul, Turkey;3. Neurophotonics Center, Boston University, Boston, MA, United States;1. Department of Electronics and Computer Engineering, Hanyang University, 222 Wangsimni-ro, Seongdong-gu, Seoul 04763, South Korea;2. Department of Computer Science and Engineering, Hanyang University, 222 Wangsimni-ro, Seongdong-gu, Seoul 04763, South Korea |
| |
| Abstract: | Various computational difficulties arise in using decision set-based vector maximization methods to solve multiple objective linear programming problems. As a result, several researchers have begun to explore the possibility of solving these problems by examining subsets of their outcome sets, rather than of their decision sets. In this article, we present and validate a basic weight set decomposition approach for generating the set of all efficient extreme points in the outcome set of a multiple objective linear program. Based upon this approach, we then develop an algorithm, called the Weight Set Decomposition Algorithm, for generating this set. A sample problem is solved using this algorithm, and the main potential computational and practical advantages of the algorithm are indicated. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
