| Provider: | J-MCDA |
|---|---|
| Version: | 0.5.5 |
Finds electre tri like models with shared profiles and individual weights that matches given group assignments.
(For outputs, see below)
The criteria to consider. Each one must have a preference direction. No preference or indifference thresholds may be included. Set some criteria as inactive (or remove them) to ignore them. Veto thresholds may be included: these will be considered as constraints on the preference model.
Optional: yes, enabled by default
The alternatives to consider. Set some alternatives as inactive (or remove them) to ignore them.
The performances of the example alternatives.
Optional: yes, enabled by default
Some performances for the profiles of the resulting model may be constrained here. The values will not necessarily be considered as is but the resulting model will satisfy the ordering implied by the constraints.
The example assignments. Use one tag per decision maker. Use the name attribute to indicate the corresponding decision maker.
The profiles and the categories names in which alternatives are to be sorted.
Whether to accept using veto thresholds in the resulting preference model. Must be true when veto threshold values are set as input.
Tag: methodParameters
Code:
<methodParameters>
<parameter>
<value>
<boolean>%1</boolean>
</value>
</parameter>
</methodParameters>
The minimum value accepted for a weight. Default is zero.
Tag: methodParameters
Code:
<methodParameters>
<parameter>
<value>
<real>%1</real>
</value>
</parameter>
</methodParameters>
The resulting veto thresholds.
The resulting group coalitions.
The performances of the shared profiles.
A status message to indicate if everything went correctly or if an error happened during the execution. Note that if the service finds that the problem is infeasible, this is not considered as an error.
The result status: if feasible, then one solution was found, otherwise the status indicates what happened (e.g. the program is infeasible).
For further technical details on the web service underlying this program, have a look at its documentation here.