Sensitivity Analysis for Convex Multiobjective Programming in Abstract Spaces

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.

Bibliographische Detailangaben

Veröffentlicht in:	Journal of mathematical analysis and applications Jg. 202; H. 2; S. 645 - 658
Hauptverfasser:	Balbás, A., Guerra, P.Jiménez
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.09.1996 Elsevier
Schlagworte:	Applied sciences Calculus of variations and optimal control Exact sciences and technology Mathematical analysis Mathematical programming Mathematics Operational research and scientific management Operational research. Management science Sciences and techniques of general use Sensitivity analysis Convex programming Optimal solution Multiobjective programming
ISSN:	0022-247X, 1096-0813
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!