Eigenvectors and consistency of the preference max-prod matrix
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F14%3A50002656" target="_blank" >RIV/62690094:18450/14:50002656 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Eigenvectors and consistency of the preference max-prod matrix
Original language description
In the paper the preference matrix is preferably processed in the max-prod algebra, which is close to the classical linear algebra. By max-prod algebra we understand a linear structure on a linearly ordered set of real numbers together with the binary operations maximum and multiplication (product), similarly as the addition and multiplication operations are used in the classical linear algebra. The preference matrix usually is not consistent, so the problem in this paper is formualed as findng the closest consistent approximation of the given preference matrix.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA14-02424S" target="_blank" >GA14-02424S: Methods of operations research for decision support under uncertainty</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Czech-japan seminar on Data analysis and decision making (CJS 2014)
ISBN
—
ISSN
2188-9759
e-ISSN
—
Number of pages
6
Pages from-to
1-6
Publisher name
Waseda university
Place of publication
Tokyo
Event location
Kitakyushu, Japan
Event date
Sep 16, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—