A method for obtaining transitive approximations of a binary relation
Jacinto González-Pachón () and
Carlos Romero ()
Annals of Operations Research, 2008, vol. 163, issue 1, 197-208
Abstract:
A binary relation R does not always possess the desirable property of transitivity. Consequently, this needs to be imposed artificially by deviating as little as possible from R. In this paper, three approaches to transitive approximation are analyzed within a common distance-based framework: exterior (transitive closure), interior (openings or maximal transitive sub-relations contained in R) and mixed (transitive fittings) approximation. Additionally, we propose a method for obtaining all these transitive approximations. The method is based on a distance function optimization framework that leads to straightforward goal programming models. Copyright Springer Science+Business Media, LLC 2008
Keywords: Binary relation; Transitive approximation; Transitive closure; Maximal transitive sub-relation; Transitive opening; Goal programming (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-008-0324-3 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:163:y:2008:i:1:p:197-208:10.1007/s10479-008-0324-3
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-008-0324-3
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().