Abstract
Crisp comparison matrices lead to crisp weight vectors being generated. Accordingly, an interval comparison matrix should give an interval weight estimate. In this paper, a goal programming (GP) method is proposed to obtain interval weights from an interval comparison matrix, which can be either consistent or inconsistent. The interval weights are assumed to be normalized and can be derived from a GP model at a time. The proposed GP method is also applicable to crisp comparison matrices. Comparisons with an interval regression analysis method are also made. Three numerical examples including a multiple criteria decision-making (MCDM) problem with a hierarchical structure are examined to show the potential applications of the proposed GP method.
Sign-in/Register to access full text options 
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.
