Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces (Q705084)

From MaRDI portal
Revision as of 01:17, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces
scientific article

    Statements

    Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces (English)
    0 references
    0 references
    0 references
    25 January 2005
    0 references
    his paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved for multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set of alternatives. The generalized saddle theorem plays a key role in the proof.
    0 references
    Multiobjective programming
    0 references
    cone-efficient solution
    0 references
    cone-quasiconvex mapping
    0 references
    generalized saddle theorem
    0 references
    connectedness
    0 references

    Identifiers