By Topic

Identifying nondominated alternatives with partial information for multiple-objective discrete and linear programming problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
B. Malakooti ; Dept. of Syst. Eng., Case Western Reserve Univ., Cleveland, OH, USA

The problem addressed is that of reducing the set of finite (discrete) multiple-criteria alternatives to a subset of alternatives based on three assumptions: that the (multiattribute) utility function is additive over attributes; that single-attribute functions are known; and that scaling constants are not known exactly but are specified by a set of linear equalities through interactions with the decision-maker (DM). Definitions, theories, and computationally efficient procedures are developed to determine whether an alternate is worthy of further consideration, should be eliminated, or is the most preferred alternative for the given partial information. The concepts of convex and tradeoff nondominancy are defined. All ensuing problems can be solved by linear programming. A computationally efficient algorithm is discussed. Other uses for the concepts developed are presented. It is shown that multiattribute discrete problems can be formulated as multiple-objective linear programming (MOLP) problems

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:19 ,  Issue: 1 )