Sensitivity in Multiobjective Programming by Differential Equations Methods. The case of Homogeneous Functions

TL;DR: The results in the paper prove that the sensitivity of the program depends on the solution of a dual program and its sensitivity.

TL;DR: In this article, the authors deal with the properties of a conic set-valued function defined on the set of all ideal points of vector programming problems and prove that certain contingent cones are determined by the ideal conic map.

TL;DR: The aim of the paper is to investigate the derivative of certain set-valued maps of efficient points and show that the sensitivity depends on a set- valued map associated to the T-Lagrange multipliers and a projection of its sensitivity.

TL;DR: In the last two decades, the theory of variational analysis including variational inequalities (VI) emerged as a rapidly growing area of research because of its applications in nonlinear analysis, optimization, economics, game theory, and so forth; see, for example, as mentioned in this paper.

TL;DR: The Origin of the Multiobjective Problem and a Short Historical Review are reviewed and a method for Generating Adjacent Extreme Points - A Second Approach (Multicriteria Simplex Method).

TL;DR: Introduction History and Applications Development of the LGP Model An Algorithm for Solution Algorithm Illustration Duality and Sensitivity Analysis Extensions