Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity (Q1304646)

From MaRDI portal
Revision as of 13:55, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
scientific article

    Statements

    Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity (English)
    0 references
    0 references
    0 references
    10 May 2000
    0 references
    In this paper the authors examine nonsmooth multiobjective problems where the objective function and the constraints are composition of \(V-\rho\)-invex functions. For the composite nonsmooth multjobjective programs involving locally Lipschitz functions they prove generalized Karush-Kuhn-Tucker sufficient optimality theorems and two duality theorems: weak duality and strong duality. In the last part they prove weak saddle point theorems for nonsmooth composite multiobjective programs whose functions are locally Lipschitz and Gateaux differentiable.
    0 references
    multiobjective programming
    0 references
    optimality conditions
    0 references
    duality
    0 references
    weak vector saddle point
    0 references

    Identifiers