Experiments with an interactive paired comparison simplex method for molp problems |
| |
Authors: | B. Malakooti A. Ravindran |
| |
Affiliation: | (1) Systems Engineering, Department and Center for Automation and Intelligent Systems, Case Western Reserve University, 44106 Cleveland, Ohio, USA;(2) School of Industrial Engineering, University of Oklahoma, 73019 Norman, Oklahoma, USA |
| |
Abstract: | In this paper, an interactive paired comparison simplex based method formultipleobjectivelinearprogramming (MOLP) problems is developed and compared to other interactive MOLP methods. Thedecisionmaker (DM)'s utility function is assumed to be unknown, but is an additive function of his known linearized objective functions. A test for utilityefficiency for MOLP problems is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion of strength ofpreference is developed for the assessment of the DM's unknown utility function where he can express his preference for a pair of extreme points as strong, weak, or almost indifferent. The problem of inconsistency of the DM is formalized and its resolution is discussed. An example of the method and detailed computational results comparing it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive multiple objective programming methods are also discussed.All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors. |
| |
Keywords: | Interactive multiple objective linear programming comparative evaluation test problems and computational results assessment with strength of preference inconsistency resolution and fuzzy preferences |
本文献已被 SpringerLink 等数据库收录! |
|