Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity (Q1304646): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1006/jmaa.1999.6409 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1006/JMAA.1999.6409 / rank
 
Normal rank

Latest revision as of 17:47, 10 December 2024

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