Simple Ranking Methods for Allocation of One Resource
From MaRDI portal
Publication:3895236
DOI10.1287/mnsc.26.1.34zbMath0448.90049OpenAlexW2101957348MaRDI 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 allocationmarketingportfolio selectioncapital budgetingsingle linear constraintallocation of one resourcenonlinearadditive objective functionsimple ranking methods
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Operations research and management science (90B99) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Portfolio theory (91G10)
Related Items (44)
Determination of reorder points for spare parts in a two-echelon inventory system: The case of non identical maintenance facilities ⋮ A graphical method to solve a maximin allocation problem ⋮ DYNAMIC OPTIMAL BUDGET ALLOCATION FOR INTEGRATED MARKETING CONSIDERING PERSISTENCE ⋮ Stochastic allocation of a resource among partially interchangeable activities ⋮ Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables ⋮ LOG-CONCAVITY OF COMPOUND DISTRIBUTIONS WITH APPLICATIONS IN OPERATIONAL AND ACTUARIAL MODELS ⋮ Resource allocation among competing activities: A lexicographic minimax approach ⋮ A graphical bicriteria approach to the resource allocation problem ⋮ Decision model and analysis for investment interest expense deduction and allocation ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Simple solution procedures for nonlinear programming problems that are derivative decomposable ⋮ Max-min resource allocation ⋮ Stochastic linear knapsack programming problem and its application to a portfolio selection problem ⋮ Assessing reliability of modular software ⋮ Convex programming with single separable constraint and bounded variables ⋮ Single-period stochastic demand fulfillment in customer hierarchies ⋮ Application of sphere packing theory in financial management ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ Polymatroidal flow network models with multiple sinks ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A faster algorithm for the resource allocation problem with convex cost functions ⋮ Breakpoint searching algorithms for the continuous quadratic knapsack problem ⋮ Solution of some convex separable resource allocation and production planning problems with bounds on the variables ⋮ Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints ⋮ Nonconvex piecewise linear knapsack problems ⋮ Managing blood inventory with multiple independent sources of supply ⋮ Optimal spares allocation to an exchangeable-item repair system with tolerable wait ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ On the robustness of mixture index of fit ⋮ An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ Composing batches with yield uncertainty ⋮ A min-max resource allocation problem with substitutions ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ Discrete resource allocation with tree constraints by an incremental method ⋮ Order transmission efficiency optimization in hierarchical organizations ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Cyclic service queues with very short service times ⋮ Solution techniques for some allocation problems
This page was built for publication: Simple Ranking Methods for Allocation of One Resource
