A nonlinear minimax allocation problem with multiple knapsack constraints

DOI10.1016/0167-6377(91)90057-VMaRDI QIDQ1178726zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An algorithm for separable nonlinear minimax problems
• Minimax resource allocation problems with ordering constraints
• The nonlinear knapsack problem - algorithms and applications
• A minimax resource allocation problem with variable resources
• A Max-Min Allocation Problem: Its Solutions and Applications

Cites work

• A graphical method to solve a maximin allocation problem
• A Max-Min Allocation Problem: Its Solutions and Applications
• An algorithm for separable nonlinear minimax problems
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Continuous maximin knapsack problems with GLB constraints
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• Max-min resource allocation
• Minimax resource allocation problems: Optimization and parametric analysis
• Minimax Resource Allocation with Tree Structured Substitutable Resources
• Optimal storage allocation for serial files
• Resource allocation among competing activities: A lexicographic minimax approach
• Simple Ranking Methods for Allocation of One Resource
• Solving knapsack sharing problems with general tradeoff functions
• Technical Note—Allocation of Effort Resources among Competing Activities
• The flow circulation sharing problem
• The Knapsack Sharing Problem

Cited in

(16)

• An algorithm for separable nonlinear minimax problems
• Minimax resource allocation problems: Optimization and parametric analysis
• Min-max optimization of several classical discrete optimization problems
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• Bounded knapsack sharing
• Finite method for a nonlinear allocation problem
• Fair optimization and networks: a survey
• A survey on the continuous nonlinear resource allocation problem
• Continuous maximin knapsack problems with GLB constraints
• Equitable bandwidth allocation in content distribution networks
• Bounded Linear Allocation With A Nonlinear Cost Constraint Is An Unconstrained Problem
• Minmax linear knapsack problem with grouped variables and gub
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• Minimax resource allocation problems with ordering constraints
• On the multicriteria allocation problem
• Nonconvex piecewise linear knapsack problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178726)