An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
From MaRDI portal
Publication:5085488
DOI10.1287/IJOC.2020.0999OpenAlexW3095989740MaRDI QIDQ5085488FDOQ5085488
Hadi El-Amine, Nevin Mutlu, Jung Ho Park
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.0999
robust optimizationcontinuous nonlinear optimizationBenders-type decompositioninterval minimax regret
Cites Work
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- Title not available (Why is that?)
- The Dirichlet problem for the convex envelope
- Title not available (Why is that?)
- Regret in the Newsvendor Model with Partial Information
- Solving mixed integer nonlinear programs by outer approximation
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An Algorithm for Separable Nonconvex Programming Problems
- A survey on the continuous nonlinear resource allocation problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- On the complexity of minmax regret linear programming
- A Newton-type algorithm for solving problems of search theory
- Search and Its Optimization
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- Minmax regret linear resource allocation problems.
- An approximation algorithm for convex multi-objective programming problems
- On Reducing a Resource Allocation Problem to a Single One-Dimensional Minimization of a Differentiable Convex Function
- A graphical method to solve a family of allocation problems
- Min-max regret robust optimization approach on interval data uncertainty
- Energy crop supply in France: a min-max regret approach
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Genetic algorithm essentials
- Robust interval-based minimax-regret analysis method for filter management of fluid power system
- Robust regret for uncertain linear programs with application to co-production models
- Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty
Cited In (1)
Uses Software
This page was built for publication: An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085488)