An interactive MCDM weight space reduction method utilizing a tchebycheff utility function

Robert F. Dell and Mark H. Karwan

Naval Research Logistics (NRL), 1990, vol. 37, issue 2, 263-277

Abstract: Employing a Tchebycheff utility function to locally approximate the underlying utility function, we develop an interactive method to solve multiple‐objective linear programming problems involving a single decision maker. We utilize selected and consistent weights in an augmented Tchebycheff linear programming formulation to obtain nondominated alternatives. Based on pairwise comparisons between alternatives, we generate constraints on the weights used to combine the decision maker's objectives. The constraints, formed to be consistent with a Tchebycheff function, lead to multiple disjoint convex regions in weight space. An algorithm is presented, and its performance is compared to the Zionts‐Walenius method for various true underlying utility functions.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199004)37:23.0.CO;2-6

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:37:y:1990:i:2:p:263-277

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().