Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
type: Item
instance of: scholarly article
title: Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
zbMATH Open document ID: 0674.90007
DOI: 10.1016/0305-0548(79)90023-6
published in: Computers \& Operations Research
publication date: 1989-01-01T00:00:00Z
review text: It is demonstrated how a multiple attribute utility function (MAUF) can be expressed as a quasi-concave or quasi-convex function using non-unique weights. The author discusses three types of local information on weights: unique (half-space), partial information on unique (convex- cone), and non-unique (nonconvex cone). A simple method for assessing such a MAUF including evaluating and ranking is discussed.
Mathematics Subject Classification ID: 91B16
zbMATH DE Number: 4104657
zbMATH Keywords: multiple attribute utility function
zbMATH Keywords: local information on weights
author: Behnam B. Malakooti
reviewed by: Krzysztof Piasecki
MaRDI profile type: Publication
full work available at URL: 0305-0548(79)90023-6
OpenAlex ID: W2003879039
cites work: A Comparative Study of Flow-Shop Algorithms
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
cites work: Q5650198
cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem
description: scientific article; zbMATH DE number 4104657