On the complexity of robust geometric programming with polyhedral uncertainty (Q2294257)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of robust geometric programming with polyhedral uncertainty
scientific article

    Statements

    On the complexity of robust geometric programming with polyhedral uncertainty (English)
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    0 references
    robust optimization
    0 references
    geometric programming
    0 references
    complexity
    0 references
    co-NP hardness
    0 references
    0 references
    0 references