Linear Multiple Objective Problems with Interval Coefficients

Gabriel R. Bitran
Additional contact information
Gabriel R. Bitran: Massachusetts Institute of Technology

Management Science, 1980, vol. 26, issue 7, 694-706

Abstract: In this paper we consider linear multiple objective programs with coefficients of the criteria given by intervals. This class of problems is of practical interest since in many instances it is difficult to determine precisely the coefficients of the objective functions. A subproblem to test if a feasible extreme point is efficient in the problem considered is obtained. A branch and bound algorithm to solve the subproblem as well as computational results are provided. Extensions are discussed.

Keywords: multiple objective decision making; vector optimization; efficient points; admissible points (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.7.694 (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:26:y:1980:i:7:p:694-706

Access Statistics for this article

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