On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity (Q1723855)

From MaRDI portal
Revision as of 04:42, 18 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
On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity
scientific article

    Statements

    On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity (English)
    0 references
    14 February 2019
    0 references
    Summary: We are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem. Under the Lipschitz \((\Phi, \rho)\)-invexity assumptions, we derive the sufficiency of the necessary optimality conditions for the same problem. We also formulate dual and establish weak, strong, and strict converse duality theorems for Problem (SIP) and its dual. These results extend several known results to a wider class of problems.
    0 references
    nonsmooth semi-infinite minimax programming
    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
    0 references