Paratingent derivative applied to the measure of the sensitivity in multiobjective differential programming (Q2319132)

From MaRDI portal
Revision as of 04:39, 20 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Paratingent derivative applied to the measure of the sensitivity in multiobjective differential programming
scientific article

    Statements

    Paratingent derivative applied to the measure of the sensitivity in multiobjective differential programming (English)
    0 references
    0 references
    16 August 2019
    0 references
    Summary: We analyse the sensitivity of differential programs of the form \(\operatorname{Min} f(x)\) subject to \(g(x) = b, x \in D\) where \(f\) and \(g\) are \(\mathcal{C}^1\) maps whose respective images lie in ordered Banach spaces. Following previous works on multiobjective programming, the notion of \(T\)-optimal solution is used. The behaviour of some nonsingleton sets of \(T\)-optimal solutions according to changes of the parameter \(b\) in the problem is analysed. The main result of the work states that the sensitivity of the program is measured by a Lagrange multiplier plus a projection of its derivative. This sensitivity is measured by means of the paratingent derivative.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references