A bilevel bottleneck programming problem (Q1390218)

From MaRDI portal
Revision as of 12:09, 31 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127473178, #quickstatements; #temporary_batch_1722424008430)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A bilevel bottleneck programming problem
scientific article

    Statements

    title
    A bilevel bottleneck programming problem (English)
    0 references
    author
    Kanchan Mathur
    0 references
    Munish C. Puri
    0 references
    publication date
    14 July 1998
    0 references
    zbMATH Keywords
    bilevel programming
    0 references
    linear constraints
    0 references
    concave bottleneck functions
    0 references
    non-convex programming
    0 references
    cites work
    On a min-max problem
    0 references
    A min max problem
    0 references
    Q3989989
    0 references
    Q4168778
    0 references
    Q4039868
    0 references

    Identifiers

    zbMATH DE Number
    1175019
    0 references
    Wikidata QID
    Q127473178
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1390218&oldid=37487569"
    Powered by MediaWiki