On sensitivity in linear multiobjective programming

On sensitivity in linear multiobjective programming

0.00 Avg rating0 Votes
Article ID: iaor2002450
Country: United States
Volume: 107
Issue: 3
Start Page Number: 615
End Page Number: 626
Publication Date: Dec 2000
Journal: Journal of Optimization Theory and Applications
Authors: ,
Keywords: programming: multiple criteria
Abstract:

In this paper, we prove that, if the data of a linear multiobjective programming problem are smooth functions of a parameter, then in the parameter space there is an open dense subset where the efficient solution set of the problem can be locally represented as a union of some faces whose vertices and directions are smooth functions of the parameter.

Reviews

Required fields are marked *. Your email address will not be published.