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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of mathematical analysis and applications Ročník 202; číslo 2; s. 645 - 658
Hlavní autoři:	Balbás, A., Guerra, P.Jiménez
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.09.1996 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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