An algorithm for separable nonlinear minimax problems

DOI10.1016/0167-6377(87)90013-7zbMath0628.90071MaRDI QIDQ1093547

Hanan Luss

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

zbMATH Keywords

production scheduling; large-scale systems; minimax resource allocation; non-negative parameters; set of linear constraints

Mathematics Subject Classification ID

90C30: Nonlinear programming

90B30: Production models

Related Items

Solving knapsack sharing problems with general tradeoff functions, 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, Min-max optimization of several classical discrete optimization problems, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, Bounded knapsack sharing, A survey on the continuous nonlinear resource allocation problem, Equitable bandwidth allocation in content distribution networks

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