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

From MaRDI portal





scientific article; zbMATH DE number 7023083
Language Label Description Also known as
default for all languages
No label defined
    English
    LP well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints
    scientific article; zbMATH DE number 7023083

      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
      0 references
      0 references
      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
      0 references