Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems

Mordechai I. Henig
Additional contact information
Mordechai I. Henig: Faculty of Management, Tel Aviv University, Tel Aviv, Israel

Management Science, 1994, vol. 40, issue 7, 891-897

Abstract: Given an acyclic network and a preference-order relation on paths, when and how can Bellman's principle of optimality be combined with interactive programming to efficiently locate an optimal path? We show that if preferences are defined via a collection of attributes, then, under common conditions, the principle of optimality is valid if and only if the preferences can be represented by a linear (value) function over the attributes. Consequently, an interactive programming method is suggested which assesses the value function while using the principle of optimality to efficiently search for an optimal path.

Keywords: multiple criteria decision analysis; multiple criteria dynamic programming; multiattribute utility (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.40.7.891 (application/pdf)

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:inm:ormnsc:v:40:y:1994:i:7:p:891-897

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().