Computes assignments according to the Electre TRI procedure.Olivier Cailloux <olivier.cailloux@ecp.fr>http://sourceforge.net/projects/j-mcda/The alternatives to consider. Set some alternatives as inactive (or remove them) to ignore them.The profiles of the categories in which alternatives are to be sorted.The weights of the criteria to consider.The performances of the alternatives.The performances of the profiles.The majority threshold specifying where to cut the outranking relation.%1
]]>
The criteria to consider, possibly with preference, indifference and veto thresholds. Each one must have a preference direction. Set some criteria as inactive (or remove them) to ignore them.The type of sorting to use (optimistic, pessimistic or both).
]]>
Optimistic sorting.OPTIMISTICPessimistic sorting.PESSIMISTICSorting both optimistic and pessimistic.BOTHWhether the veto thresholds are considered crisp (or binary). If true, a veto either has full effect (when the performance is low enough for the veto to activate) or no effect at all. Defaults to false, thus the vetoes may have partial effect, as in the original Electre Tri description.%1
]]>