We establish a range of sufficient conditions for (proper) Pareto optimality of all points in natural domains of multicriteria optimization problems.
Verification of weight coefficients in multicriteria optimization problems
β Scribed by V. Dekhtyarenko
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 531 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper looks at the problem of verification of the weight coefficients in multiattribute decision making.
A procedure is developed based on a priori qualitative evaluations used to form a partial linear ordering of the alternatives. A suitable algorithm is presented.
π SIMILAR VOLUMES
This paper addresses multicriteria decision problems in which only partial information is given in the decisionmaking process. We generalize existing results about preference relations induced by nonnegative inverse matrices, allowing linear relations on weights with upper and lower bounds. In addit
The majority of engineering problems are essentially multicriteria. These criteria are usually contradictory. That is why specialists experience significant difficulties in correctly stating engineering optimization problems, so designers often end up solving ill-posed problems. In general, it is im
The aim of this paper is to emphasize some remarkable properties of multicriteria optimization problems involving lexicographic quasiconvex objective functions. It is shown that, under appropriate assumptions, these problems are Pareto reducible and their efficient sets are strongly contractible.