Technical Note—Allocation of Effort Resources among Competing Activities
From MaRDI portal
Publication:4053351
DOI10.1287/opre.23.2.360zbMath0298.90015OpenAlexW2086427885MaRDI QIDQ4053351
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.2.360
Related Items
Maximum likelihood estimation of cell probabilities in constrained multinomial models ⋮ Fuzzy resource allocation ⋮ A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks ⋮ Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables ⋮ Resource allocation among competing activities: A lexicographic minimax approach ⋮ An algorithm for separable nonlinear minimax problems ⋮ A graphical bicriteria approach to the resource allocation problem ⋮ 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 ⋮ A nonlinear knapsack problem ⋮ A particle swarm optimization approach to the nonlinear resource allocation problem ⋮ Max-min resource allocation ⋮ Quadratic resource allocation with generalized upper bounds ⋮ Multiobjective resource allocation problem by multistage decision-based hybrid genetic algorithm ⋮ Convex programming with single separable constraint and bounded variables ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ Probabilistic solutions for a class of deterministic optimal allocation problems ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ An algorithm for the fair resource allocation problem with a submodular constraint ⋮ On a general network location--production--allocation problem ⋮ 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 ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ Theoretical framework for the analysis of linearly constrained convex programs ⋮ Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique ⋮ Ant colony optimization for the nonlinear resource allocation problem ⋮ An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint ⋮ Productivity of activities in the optimal allocation of one resource ⋮ On the solution of concave knapsack problems ⋮ A min-max resource allocation problem with substitutions ⋮ A polynomially bounded algorithm for a singly constrained quadratic program ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ A graphical method to solve a family of allocation problems ⋮ A weak linearization of the Kuhn- Tucker conditions for a class of allocation problems ⋮ Discrete resource allocation with tree constraints by an incremental method ⋮ Order transmission efficiency optimization in hierarchical organizations ⋮ Alternatives for reliable and quality telecommunication network design ⋮ Solution techniques for some allocation problems
