An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
From MaRDI portal
(Redirected from Publication:5085488)
Recommendations
- Minmax regret linear resource allocation problems.
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- An algorithm for separable nonlinear minimax problems
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Newton-type algorithm for solving problems of search theory
- A convex envelope formula for multilinear functions
- A graphical method to solve a family of allocation problems
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- A survey on the continuous nonlinear resource allocation problem
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- An Algorithm for Separable Nonconvex Programming Problems
- An approximation algorithm for convex multi-objective programming problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Energy crop supply in France: a min-max regret approach
- Genetic algorithm essentials
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Min-max regret robust optimization approach on interval data uncertainty
- Minmax regret linear resource allocation problems.
- On Reducing a Resource Allocation Problem to a Single One-Dimensional Minimization of a Differentiable Convex Function
- On the complexity of minmax regret linear programming
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- Regret in the Newsvendor Model with Partial Information
- Robust interval-based minimax-regret analysis method for filter management of fluid power system
- Robust optimization
- Robust postdonation blood screening under prevalence rate uncertainty
- Robust regret for uncertain linear programs with application to co-production models
- Search and Its Optimization
- Solving mixed integer nonlinear programs by outer approximation
- The Dirichlet problem for the convex envelope
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
- \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
Cited in
(1)
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)
