LP well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints (Q1724987): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:28, 5 March 2024

scientific article
Language Label Description Also known as
English
LP well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints
scientific article

    Statements

    LP well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Summary: The purpose of this paper is introduce several types of Levitin-Polyak well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints. Base on criterion and characterizations for these types of Levitin-Polyak well-posedness we argue on diameters and Kuratowski's, Hausdorff's, or Istrǎtescus measures of noncompactness of approximate solution sets under suitable conditions, and we prove the Levitin-Polyak well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints. Obtain a gap function for bilevel vector equilibrium problems with equilibrium constraints using the nonlinear scalarization function and consider relations between these types of LP well-posedness for bilevel vector optimization problems with equilibrium constraints and these types of Levitin-Polyak well-posedness for bilevel vector equilibrium problems with equilibrium constraints under suitable conditions; we prove the Levitin-Polyak well-posedness for bilevel equilibrium and optimization problems with equilibrium constraints.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references