An exact algorithm for large-scale continuous nonlinear resource allocation problems with minimax regret objectives
| Year of publication: |
2021
|
|---|---|
| Authors: | Park, Jungho ; El-Amine, Hadi ; Mutlu, Nevin |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 1213-1228
|
| Subject: | robust optimization | interval minimax regret | continuous nonlinear optimization | Benders-type decomposition | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Algorithmus | Algorithm | Nichtlineare Optimierung | Nonlinear programming | Allokation | Allocation | Robustes Verfahren | Robust statistics |
-
Data-driven optimization with distributionally robust secondorder stochastic dominance constraints
Peng, Chun, (2021)
-
Hanks, Robert W., (2017)
-
Modeling defender-attacker problems as robust linear programs with mixed-integer uncertainty sets
Borrero, Juan S., (2021)
- More ...
-
Offering memories to sell goods? : pricing and welfare implications of experiential retail
Mutlu, Nevin, (2023)
-
Aprahamian, Hrayer, (2022)
-
Robust postdonation blood screening under prevalence rate uncertainty
El-Amine, Hadi, (2018)
- More ...