A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940)

From MaRDI portal
Revision as of 12:50, 21 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A decomposition approach for global optimum search in QP, NLP and MINLP problems
scientific article

    Statements

    title
    A decomposition approach for global optimum search in QP, NLP and MINLP problems (English)
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    decomposition of the constraint set
    0 references
    describes a project that uses
    MINOS
    0 references
    GAMS
    0 references
    cites work
    Q5630864
    0 references
    Q4744068
    0 references
    Q4744069
    0 references

    Identifiers

    DOI
    10.1007/BF02283690
    0 references
    Mathematics Subject Classification ID
    90C26
    0 references
    90-08
    0 references
    49M27
    0 references
    90C20
    0 references
    65K05
    0 references
    zbMATH DE Number
    4183180
    0 references
    Wikidata QID
    Q114859334
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2638940&oldid=34842500"
    Powered by MediaWiki