An algorithm for separable nonlinear minimax problems
From MaRDI portal
Publication:1093547
DOI10.1016/0167-6377(87)90013-7zbMath0628.90071OpenAlexW2007484144MaRDI QIDQ1093547
Publication date: 1987
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(87)90013-7
production schedulinglarge-scale systemsminimax resource allocationnon-negative parametersset of linear constraints
Related Items (11)
Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Equitable bandwidth allocation in content distribution networks ⋮ A lexicographic minimax algorithm for multiperiod resource allocation ⋮ Minimax resource allocation problems: Optimization and parametric analysis ⋮ Bounded knapsack sharing ⋮ A min-max resource allocation problem with substitutions ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Fair optimization and networks: a survey ⋮ Solving knapsack sharing problems with general tradeoff functions
Cites Work
- Unnamed Item
- Max-min resource allocation
- A graphical method to solve a maximin allocation problem
- Resource allocation among competing activities: A lexicographic minimax approach
- An algorithm for solving linearly constrained minimax problems
- Continuous maximin knapsack problems with GLB constraints
- Linear max-min programming
- Technical Note—Allocation of Effort Resources among Competing Activities
- New algorithms for constrained minimax optimization
- Linearly constrained minimax optimization
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Allocation of Total Sample Size When Only the Stratum Means Are of Interest
This page was built for publication: An algorithm for separable nonlinear minimax problems
