Minimax resource allocation problems: Optimization and parametric analysis

DOI10.1016/0377-2217(92)90335-7zbMath0773.90046OpenAlexW2001921343MaRDI QIDQ1198300

Hanan Luss

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90335-7

zbMATH Keywords

parametric analysislinear minimax resource allocationmultiple knapsack-type resource constraintspost-optimization schemes

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) 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 (18)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ Heuristic and reduction algorithms for the knapsack sharing problem ⋮ New upper bounds and exact methods for the knapsack sharing problem ⋮ Multiperiod allocation of substitutable resources ⋮ Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item ⋮ Continuity and monotonicity of solutions to a greedy maximization problem ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Approximation based fuzzy multi-objective models with expected objectives and chance constraints: application to earth-rock work allocation ⋮ A best first search exact algorithm for the multiple-choice multidimensional knapsack problem ⋮ An exact algorithm for the knapsack sharing problem ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ A minimax resource allocation problem with variable resources ⋮ A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem ⋮ A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem ⋮ Allocating multiple defensive resources in a zero-sum game setting ⋮ An exact algorithm for the knapsack sharing problem with common items

Cites Work

• 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
• A nonlinear minimax allocation problem with multiple knapsack constraints
• A min-max resource allocation problem with substitutions
• Continuous maximin knapsack problems with GLB constraints
• Minimax Resource Allocation with Tree Structured Substitutable Resources
• A Max-Min Allocation Problem: Its Solutions and Applications
• A mofified gub algorithm for solving linear minimax problems

This page was built for publication: Minimax resource allocation problems: Optimization and parametric analysis