scientific article; zbMATH DE number 3974717

From MaRDI portal
Publication:3740566





[For the entire collection see Zbl 0547.00055.] Let X be a finite set of alternatives and F be an n-dimensional vector valued function. A finite multicriterial decision problem \(\max _{x\in X}F(x)\), where max means vector maximization, is studied. By m(x,y) the author denotes a number of criteria for which \(x\in X\) is dominated by \(y\in X\), and \[ M_ X(x)=\max_{y\in X}m(x,y) \] is called a domination index of \(x\in X\). There exists a partion \[ X=\cup^{n}_{j=0}X_ j\quad such\quad that\quad X_ j=\{x\in X| M_ X(x)=j\} \] where \(j=0,1,...,n\). \(X_ j\) is a subset of X with the same domination index for all its elements. Evidently, \(\cup^{n- 1}_{j=0}X_ j\) is the Pareto set of all efficient alternatives. In the paper the following decision rule for the finite multicriterial decision problem is suggested: choose \(x\in X_ j\) where \(X_ j\) is a nonempty set with lowest j.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740566)