Resource allocation among competing activities: A lexicographic minimax approach

DOI10.1016/0167-6377(86)90012-XzbMath0627.90068OpenAlexW2013034279MaRDI QIDQ1092812

Donald R. Smith, Hanan Luss

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90012-x

zbMATH Keywords

production planninglarge scale resource allocationlexicographic minmax algorithmminmax linear programmingnon-simplex algorithm

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Production models (90B30)

Related Items (18)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ CMIT, capacitated multi-level implosion tool ⋮ An algorithm for separable nonlinear minimax problems ⋮ The implementation of dynamic rate allocation in sensor networks ⋮ 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 ⋮ Some of my favorite integer programming applications at IBM ⋮ Bounded knapsack sharing ⋮ A min-max resource allocation problem with substitutions ⋮ Min-max optimization of several classical discrete optimization problems ⋮ An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems ⋮ Material allocation in MRP with tardiness penalties ⋮ Editorial. Fair optimization and networks: models, algorithms, and applications ⋮ Fair optimization and networks: a survey ⋮ Solving knapsack sharing problems with general tradeoff functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for solving linearly constrained minimax problems
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• The Theory of Search: Optimum Distribution of Search Effort
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Simple Ranking Methods for Allocation of One Resource
• Solution techniques for some allocation problems
• Technical Note—Allocation of Effort Resources among Competing Activities
• Allocation of Marketing Effort Among P Substitutional Products in N Territories^†
• Allocation of Total Sample Size When Only the Stratum Means Are of Interest

This page was built for publication: Resource allocation among competing activities: A lexicographic minimax approach