Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs (Q3217951)

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 3883954
Language Label Description Also known as
default for all languages
No label defined
    English
    Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs
    scientific article; zbMATH DE number 3883954

      Statements

      Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs (English)
      0 references
      0 references
      0 references
      1984
      0 references
      Monte Carlo
      0 references
      large-scale stochastic linear programs
      0 references
      special structure
      0 references
      redundant constraints
      0 references
      random search
      0 references
      Many problems involving uncertainty can be formulated as large-scale stochastic linear programs. Standard solution techniques are, however, severely limited by problem size. The programs do, nevertheless, possess special structure that often includes a large proportion of redundant constraints. We present procedures for exploiting this structure by efficiently identifying nonredundant constraints, thereby resulting in a decrease in effective problem size. Our procedures are based on recursively generating random search directions from points within the feasible region.
      0 references

      Identifiers