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 |
-
An inexact column-and-constraint generation method to solve two-stage robust optimization problems
Tsang, Man Yiu, (2023)
-
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
Ben-Tal, Aharon, (2011)
-
Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
Shen, Linsong, (2016)
- More ...
-
Offering memories to sell goods? : pricing and welfare implications of experiential retail
Mutlu, Nevin, (2023)
-
Solving a production-routing problem with price-dependent demand using an outer approximation method
Torkaman, Somayeh, (2020)
-
Torkaman, Somayeh, (2022)
- More ...