Skip to main content
Log in

A method for obtaining transitive approximations of a binary relation

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Bandler, W., & Kohout, L. (1988). Special properties, closures and interiors of crisp and fuzzy relations. Fuzzy Sets and Systems, 26, 317–331.

    Article  Google Scholar 

  • Charnes, A., & Cooper, W. W. (1977). Goal programming and multiple objective optimisation: Part 1. European Journal of Operational Research, 1, 39–54.

    Article  Google Scholar 

  • De Baets, B., & De Meyer, H. (2003). Transitive approximation of fuzzy relations by alternating closures and openings. Soft Computing, 7, 210–219.

    Google Scholar 

  • Fodor, J. C., & Roubens, M. (1995). Structure of transitive valued binary relation. Mathematical Social Science, 30, 71–94.

    Article  Google Scholar 

  • González-Pachón, J., & Ríos-Insua, S. (1999). Mixture of maximal quasi orders: a new approach to preference modelling. Theory and Decision, 47, 73–88.

    Article  Google Scholar 

  • González-Pachón, J., & Romero, C. (1999). Distance-based consensus methods: a goal programming approach. OMEGA, 27, 341–347.

    Article  Google Scholar 

  • Roberts, F. S. (1979). Measurement theory. Reading: Addison Wesley.

    Google Scholar 

  • Romero, C. (1991). Handbook of critical issues in goal programming. Oxford: Pergamon Press.

    Google Scholar 

  • Roubens, M., & Vincke, Ph. (1985). Preference modelling. Berlin: Springer.

    Google Scholar 

  • Roy, B. (1996). Multicriteria methodology for decision aiding. Dordrecht: Kluwer Academic.

    Google Scholar 

  • Sen, A. K. (1970). Collective choice and social welfare. San Francisco: Holden-Day.

    Google Scholar 

  • Tsoukias, A. (2003). From decision theory to decision aiding methodology (DIMACS Technical Report, 2003-21) (http://www.lamsade.dauphine.fr/~tsoukias/recent.htm).

  • Zadeh, L. (1971). Similarity relations and fuzzy ordering. Information Science, 3, 177–200.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jacinto González-Pachón.

Rights and permissions

Reprints and permissions

About this article

Cite this article

González-Pachón, J., Romero, C. A method for obtaining transitive approximations of a binary relation. Ann Oper Res 163, 197–208 (2008). https://doi.org/10.1007/s10479-008-0324-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0324-3

Keywords

Navigation