Sensitivity analysis for convex multiobjective programming in abstract spaces

Sensitivity analysis for convex multiobjective programming in abstract spaces

0.00 Avg rating0 Votes
Article ID: iaor20012974
Country: United States
Volume: 202
Start Page Number: 645
End Page Number: 658
Publication Date: Jan 1996
Journal: Journal of Mathematical Analysis and Applications
Authors: ,
Keywords: duality
Abstract:

The main object of this paper is to prove that for a linear or convex multiobjective program, a dual program can be obtained which gives the primal sensitivity without any special hypothesis about the way of choosing the optimal solution in the efficient set.

Reviews

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