The Linear Sharing Problem

DOI10.1287/OPRE.32.5.1087MaRDI QIDQ3346096zbMATH OpenOpenAlexFDO

Authors J. Randall Brown

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

zbMATH Keywords

algorithmComputational experienceglobal upper boundlinear sharing problemmaximin objective functionoptimal solutionoptimality conditions

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Nonlinear programming (90C30)

Recommendations

• Publication:4896283
• Linear and combinatorial sharing problems
• Solving knapsack sharing problems with general tradeoff functions
• Bounded knapsack sharing
• Publication:4732313

Cited in

(11)

• Linear and combinatorial sharing problems
• Multiperiod allocation of substitutable resources
• The balanced linear programming problem
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• Linear-shaped partition problems
• Bounded knapsack sharing
• Sharing-group allocation problems
• On a linear programming model and its solution in explicit form
• Sharing problems
• scientific article; zbMATH DE number 936866 (Why is no real title available?)
• Solving knapsack sharing problems with general tradeoff functions

This page was built for publication: The Linear Sharing Problem

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