The complementary unboundedness of dual feasible solution sets in convex programming (Q4138493)

From MaRDI portal
Revision as of 02:19, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3566562
Language Label Description Also known as
English
The complementary unboundedness of dual feasible solution sets in convex programming
scientific article; zbMATH DE number 3566562

    Statements

    title
    The complementary unboundedness of dual feasible solution sets in convex programming (English)
    0 references
    author
    Elmor L. Peterson
    0 references
    publication date
    1977
    0 references

    Identifiers

    DOI
    10.1007/BF01593806
    0 references
    zbMATH DE Number
    3566562
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4138493&oldid=8603097"
      Powered by MediaWiki