Abstract
DISCRET has been developed to deal with multicriteria optimization and decision making problems with a finite number of discrete alternatives. The following problem structure is assumed: (i) All feasible alternatives (decisions) are explicitly listed in the set XO = {x1,x2,...,xn}. (ii) All of the decision maker’s (DM) criteria are known. Both ordinal and cardinal criteria are permitted. Let f(x) = = (f1(x),f2(x),…,fm(x)) be the criteria vector. (iii) For each alternative the criteria are evaluated and their values listed in the set Q = {f(x1),f(x2),…,f(xn)}.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
