No label defined (Q4667218)

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

      Statements

      0 references
      19 April 2005
      0 references
      integer programming
      0 references
      duality
      0 references
      A duality for integer programming is developed. The basis is an integration version of a linear program. The discrete versions of the LP and its integration version are the integer program and its counting version (summation). The LP dual is obtained from the Legendre-Fenchel transform, which has an analogue for integration in the Laplace transform. Thus the inverse of the Laplace transform is the analogue of the dual of the LP. Since the \(\mathbb{Z}\)-transform is the discrete analogue of the Laplace transform for summation, duality for integer programming is obtained. The paper first discusses duality for the continuous problems (LP and integration), then the \(\mathbb{Z}\)-transform and duality for the discrete problems (IP and summation) are presented. Finally, a discrete Farkas Lemma, an LP equivalent to the IP, and a relationship between this LP and the abstract dual of the IP are shown. Instead of proofs of results references to the relevant papers are given. For the entire collection see [Zbl 1054.90003].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references