Min-Max MPC based on a network problem (Q2474457)

From MaRDI portal
Revision as of 18:27, 27 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
Min-Max MPC based on a network problem
scientific article

    Statements

    title
    Min-Max MPC based on a network problem (English)
    0 references
    publication date
    6 March 2008
    0 references
    zbMATH Keywords
    predictive control
    0 references
    robust control
    0 references
    uncertain linear systems
    0 references
    networks
    0 references
    quadratic programming
    0 references
    describes a project that uses
    CPLEX
    0 references
    GLPK
    0 references
    cites work
    Q3932576
    0 references
    Q4821526
    0 references

    Identifiers

    Mathematics Subject Classification ID
    93B40
    0 references
    93B17
    0 references
    90C20
    0 references
    93B35
    0 references
    zbMATH DE Number
    5243686
    0 references
    OpenAlex ID
    W1989655007
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2474457&oldid=35040295"
    Powered by MediaWiki