Algorithms for bicriteria combinatorial optimization problems

Katoh, N. (1989). Algorithms for bicriteria combinatorial optimization problems. In: Methodology and Software for Interactive Decision Support. pp. 47-56 Germany: Springer Berlin/Heidelberg. ISBN 978-3-662-22160-0 10.1007/978-3-662-22160-0_7.

Full text not available from this repository.

Abstract

In recent years, many types of interactive optimization methods have been developed in order to support multicriteria decision makings (see the book by Sawaragi, Nakayama and Tanino, 1985 and Wierzbicki and Lewandowski, 1987). Given a feasible decision set X ⊆ R n, and p objective functions, f l, f 2,...,f p (all are assumed to be minimization for convenience), the following problem has been used in various situations of interactive multicriteria decision makings:
minimizex∈Xmax1⩽i⩽p{αifi(x)+βi},

(1) where α i and β i are positive and real constants respectively, which are computed based on the information supplied by the decision maker and/or the decision support system. For example, α i and β i are determined from aspiration and reservation levels in the reference point method which is one of the well known methods used in interactive multicriteria decision support systems (see Wierzbicki and Lewandowski, 1987, for the survey of reference point methods).

Item Type:	Book Section
Research Programs:	System and Decision Sciences - Core (SDS)
Depositing User:	Romeo Molina
Date Deposited:	03 May 2016 11:56
Last Modified:	27 Aug 2021 17:41
URI:	https://pure.iiasa.ac.at/13059

Actions (login required)

View Item