A nonlinear minimax allocation problem with multiple knapsack constraints

DOI10.1016/0167-6377(91)90057-VzbMath0749.90073OpenAlexW2034951924MaRDI QIDQ1178726

Hanan Luss

Publication date: 26 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90057-v

zbMATH Keywords

minimax objectivenonlinear allocation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Production models (90B30) Existence of solutions for minimax problems (49J35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Equitable bandwidth allocation in content distribution networks ⋮ Minimax resource allocation problems: Optimization and parametric analysis ⋮ Bounded knapsack sharing ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Fair optimization and networks: a survey

Cites Work

• Unnamed Item
• Max-min resource allocation
• Solving knapsack sharing problems with general tradeoff functions
• 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
• Minimax resource allocation problems: Optimization and parametric analysis
• Continuous maximin knapsack problems with GLB constraints
• Minimax Resource Allocation with Tree Structured Substitutable Resources
• A Max-Min Allocation Problem: Its Solutions and Applications
• Simple Ranking Methods for Allocation of One Resource
• Technical Note—Allocation of Effort Resources among Competing Activities
• Optimal storage allocation for serial files
• The Knapsack Sharing Problem
• The flow circulation sharing problem
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation

This page was built for publication: A nonlinear minimax allocation problem with multiple knapsack constraints