Relaxation-based algorithms for minimax optimization problems with resource allocation applications
DOI10.1007/BF01582580zbMath0805.90099OpenAlexW2071095524MaRDI QIDQ1332312
Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum
Publication date: 31 January 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582580
minimax optimizationresource allocationsimplex methodFarkas multipliersknapsack type constraintsmax-flow algorithmrelaxation approachrelaxation-based algorithms
Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Existence of solutions for minimax problems (49J35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Max-min resource allocation
- Solving knapsack sharing problems with general tradeoff functions
- Minimax linear programming problem
- A graphical method to solve a maximin allocation problem
- Resource allocation among competing activities: A lexicographic minimax approach
- An algorithm for separable nonlinear minimax problems
- Representation of general and polyhedral subsemilattices and sublattices of product spaces
- An algorithm for solving linearly constrained minimax problems
- A nonlinear minimax allocation problem with multiple knapsack constraints
- A lexicographic minimax algorithm for multiperiod resource allocation
- Minimax resource allocation problems: Optimization and parametric analysis
- A min-max resource allocation problem with substitutions
- A linear-time algorithm for solving continuous maximin knapsack problems
- Continuous maximin knapsack problems with GLB constraints
- The Linear Sharing Problem
- Minimax Resource Allocation with Tree Structured Substitutable Resources
- A Max-Min Allocation Problem: Its Solutions and Applications
- Linear max-min programming
- New algorithms for constrained minimax optimization
- Linearly constrained minimax optimization
- The Knapsack Sharing Problem
- A Multiperiod Minimax Resource Allocation Problem with Substitutable Resources
- Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- A mofified gub algorithm for solving linear minimax problems
- 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: Relaxation-based algorithms for minimax optimization problems with resource allocation applications
