Advertisement

Annals of Operations Research

, Volume 253, Issue 1, pp 707–708 | Cite as

Two short proofs regarding the logarithmic least squares optimality in Chen, K., Kou, G., Tarn, J. M., Song, Y. (2015): Bridging the gap between missing and inconsistent values in eliciting preference from pairwise comparison matrices, Annals of Operations Research 235(1):155–175

  • Sándor BozókiEmail author
Addendum
  • 174 Downloads

Keywords

Pairwise Comparison Operation Research Short Proof Laplacian Matrix Comparison Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Bozóki, S., Fülöp, J., & Rónyai, L. (2010). On optimal completion of incomplete pairwise comparison matrices. Mathematical and Computer Modelling, 52(1–2), 318–333.CrossRefGoogle Scholar
  2. Chen, K., Kou, G., Tarn, J. M., & Song, Y. (2015). Bridging the gap between missing and inconsistent values in eliciting preference from pairwise comparison matrices. Annals of Operations Research, 235(1), 155–175.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Laboratory on Engineering and Management Intelligence, Research Group of Operations Research and Decision Systems, Institute for Computer Science and ControlHungarian Academy of SciencesBudapestHungary
  2. 2.Department of Operations Research and Actuarial SciencesCorvinus University of BudapestBudapestHungary

Personalised recommendations