The Linear Sharing Problem
From MaRDI portal
Publication:3346096
DOI10.1287/opre.32.5.1087zbMath0552.90080MaRDI QIDQ3346096
Publication date: 1984
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.32.5.1087
algorithm; optimality conditions; optimal solution; Computational experience; global upper bound; linear sharing problem; maximin objective function
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C05: Linear programming
49M37: Numerical methods based on nonlinear programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
49J35: Existence of solutions for minimax problems
Related Items
Solving knapsack sharing problems with general tradeoff functions, Multiperiod allocation of substitutable resources, The balanced linear programming problem, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, Bounded knapsack sharing