A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis (Q3028753)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4016631
Language Label Description Also known as
default for all languages
No label defined
    English
    A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis
    scientific article; zbMATH DE number 4016631

      Statements

      A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis (English)
      0 references
      0 references
      1986
      0 references
      row perturbations
      0 references
      sensitivity analysis
      0 references
      stability concept
      0 references
      optimal strategies
      0 references
      matrix games
      0 references
      radius of stability
      0 references
      A stability concept for optimal strategies in matrix games is introduced. The main theorem says that the game is completely mixed iff every completely mixed optimal strategy is stable. Next the same type result is proved for positive linear programming problems. The radius of stability is defined and two formulas for its computation are presented.
      0 references

      Identifiers

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