Elicit a S-RMP model from a set of pairwise comparisons without inconsistency. The algorithm will find out a S-RMP model which is able to exactly represent all the input pairwise comparisons (if it exists). The elicitation may be infeasible due to the unknown input inconsistency.
(For outputs, see below)
A list of criteria involved in the ranking problem. For each criterion, the preference direction should be provided. Besides, the maximum and minimum should also be included.
A complete list of alternatives to be considered in the ranking problem. At least, all the alternatives appear in the provided pairwise comparisons should be included.
Values of criteria for each alternatives defined in the alternatives list.
The pairwise comparisons of alternatives provided by the decision maker.
A set of reference points (special alternatives) with their performance values on each criteria. For each reference point, the id number indicates its lexicographic order.
The weights of criteria. For each criteria, the value of weight is strictly positive and less than 0.49. The sum of weights is normalized to 1.
the lexicographic order of the reference points we use during aggregation.
Some status messages.
For further technical details on the web service underlying this program, have a look at its documentation here.