No label defined (Q3686499)

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 3908166
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3908166

      Statements

      1984
      0 references
      survey
      0 references
      duality and alternatives theorems
      0 references
      combinatorial programming
      0 references
      efficient stopping criteria
      0 references
      polyhedral aspects of oriented matroids
      0 references
      oriented adjoints
      0 references
      0 references
      This survey starts with a discussion of duality and alternatives theorems in combinatorial programming. It is shown how duality theorems lead to efficient stopping criteria for algorithms and how Farkas' Lemma can be formulated for linear diophantine systems. The main part of the paper deals with polyhedral aspects of oriented matroids and introduces oriented adjoints and their relation to Euclidean oriented matroids.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references