• Michel Grabisch
Part of the Theory and Decision Library C book series (TDLC, volume 46)


We introduce in this chapter the notation used throughout the book (see also the list of symbols), as well as the necessary mathematical background to make the book self-contained. Section 1.2 gives useful results from combinatorics, some of them being quite standard while some others are specific, and most often proofs are provided. The rest of the chapter (Sect. 1.3) gives condensed summaries about binary relations, partially ordered sets, inequalities and polyhedra, linear programming, convexity, convex optimization, etc. Of course, no proof is provided there and readers who are unfamiliar with these topics and finding the exposition rather dry should consult the mentioned references.


Partial Order Binary Relation Distributive Lattice Duality Theorem Nonempty Closed Convex Subset 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Michel Grabisch
    • 1
  1. 1.Paris School of EconomicsUniversité Paris I Panthéon-SorbonneParisFrance

Personalised recommendations