Simple Ranking Methods for Allocation of One Resource
From MaRDI portal
Publication:3895236
DOI10.1287/mnsc.26.1.34zbMath0448.90049MaRDI QIDQ3895236
Publication date: 1980
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.26.1.34
resource allocation; marketing; portfolio selection; capital budgeting; single linear constraint; allocation of one resource; nonlinearadditive objective function; simple ranking methods
65K05: Numerical mathematical programming methods
90C90: Applications of mathematical programming
90C30: Nonlinear programming
90B99: Operations research and management science
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
91G10: Portfolio theory
Related Items
A nonlinear minimax allocation problem with multiple knapsack constraints, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Composing batches with yield uncertainty, Determination of reorder points for spare parts in a two-echelon inventory system: The case of non identical maintenance facilities, Stochastic allocation of a resource among partially interchangeable activities, The nonlinear knapsack problem - algorithms and applications