Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029)

From MaRDI portal
Revision as of 14:35, 17 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
scientific article

    Statements

    title
    Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (English)
    0 references
    author
    Richard W. Cottle
    0 references
    A. Djang
    0 references
    publication date
    1979
    0 references
    zbMATH Keywords
    ALGORITHMIC EQUIVALENCE
    0 references
    QUADRATIC PROGRAMMING
    0 references

    Identifiers

    DOI
    10.1007/BF00933376
    0 references
    zbMATH DE Number
    3603028
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1250029&oldid=1561851"
      Powered by MediaWiki