Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data (Q700934)

From MaRDI portal
Revision as of 16:54, 4 June 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
Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
scientific article

    Statements

    Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2002
    0 references
    The paper is devoted to new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The paper links to the previous work by \textit{L. Liu} and \textit{M. Křížek} [Appl. Math., Praha 42, 311-320 (1997; Zbl 0903.90152)]. The vector-valued criterion function as well as constraint functions are supposed to be from the class \(C^{1,1}\). Second-order optimality conditions for local Pareto solutions are derived as a special case. The paper is well-written, definitions and theorems are precisely formulated and proofs are correct.
    0 references
    multiobjective programming
    0 references
    nonsmooth constrained optimization
    0 references
    second-order optimality conditions
    0 references
    nondominated solutions
    0 references
    local Pareto optimal solutions
    0 references

    Identifiers