Solving knapsack sharing problems with general tradeoff functions

DOI10.1007/BF01586926zbMath0733.90064MaRDI QIDQ810377

J. Randall Brown

Publication date: 1991

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01586926

zbMATH Keywords

optimality conditions; Polynomial algorithms; staircase functions; ascending function; continuous tradeoff function; knapsack sharing problem; maximin programming; minimax mathematical programming; multiple-valued objective functions

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C30: Nonlinear programming

49K35: Optimality conditions for minimax problems

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, 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, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, Bounded knapsack sharing, Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item, New upper bounds and exact methods for the knapsack sharing problem, An exact algorithm for the knapsack sharing problem, Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item

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 separable nonlinear minimax problems
• Continuous maximin knapsack problems with GLB constraints
• Technical Note—On Min-Max Integer Allocation Problems
• The Linear Sharing Problem
• A Max-Min Allocation Problem: Its Solutions and Applications
• A Stochastic Allocation Problem
• Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
• Equalization of Runout Times
• Stochastic Allocation Rules
• Optimal storage allocation for serial files
• The Sharing Problem
• The Knapsack Sharing Problem
• The flow circulation sharing problem
• On Marginal Allocation in Single Constraint Min-Max Problems
• More on Min-Max Allocation