Title: Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives
Abstract: Relations between efficient solutions to discrete multicriteria decision problems and optimal solutions to corresponding parametric single-criterion problems are analyzed. In particular we consider such decision problems where one criterion is a sum function while the remaining criteria are bottleneck functions. In this case the multi-criteria problem can be reduced to a linear parametric sum problem. Depending upon the nature of its feasible set, the sum problem may belong to a class of computationally tractable optimization problems, By solving it parametrically we can then generate the set of all efficient solutions to the original multicriteria problem.
Publication Year: 1984
Publication Date: 1984-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot