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.

Saved in:

Bibliographic Details
Published in:	Journal of mathematical analysis and applications Vol. 202; no. 2; pp. 645 - 658
Main Authors:	Balbás, A., Guerra, P.Jiménez
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.09.1996 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	0022-247X 1096-0813
DOI:	10.1006/jmaa.1996.0339