Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
From MaRDI portal
Publication:3902834
DOI10.1287/mnsc.27.4.431zbMath0454.90059OpenAlexW2143277915MaRDI QIDQ3902834
Gabriel R. Bitran, Arnoldo C. Hax
Publication date: 1981
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fd8d156660e61f6a925eb61b97d69d827389b0e9
disaggregationresource allocationrecursive procedurecomputational resultsbounded variableshierarchical planningconvex knapsack problems
Related Items (50)
Application of the dual active set algorithm to quadratic network optimization ⋮ Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables ⋮ 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 ⋮ Decentral allocation planning in multi-stage customer hierarchies ⋮ On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian ⋮ Quadratic resource allocation with generalized upper bounds ⋮ A penalty algorithm for solving convex separable knapsack problems ⋮ Convex programming with single separable constraint and bounded variables ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ On the resources allocation problem ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ Probabilistic solutions for a class of deterministic optimal allocation problems ⋮ Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints ⋮ A two-phase method for solving continuous rank-one quadratic knapsack problems ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ An algorithm for the fair resource allocation problem with a submodular constraint ⋮ Local minima for indefinite quadratic knapsack problems ⋮ 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 ⋮ Fast algorithm for singly linearly constrained quadratic programs with box-like constraints ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint ⋮ Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ Optimizing facility location and design ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ A hierarchical decision support system for production planning (with case study) ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ Heuristic family disaggregation techniques for hierarchical production planning systems ⋮ Order transmission efficiency optimization in hierarchical organizations ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung ⋮ Statistical mechanics analysis of generalized multi-dimensional knapsack problems ⋮ Solution techniques for some allocation problems ⋮ Moving Least Squares Regression for High-Dimensional Stochastic Simulation Metamodeling ⋮ An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem ⋮ Nonlinear integer programming for optimal allocation in stratified sampling ⋮ The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
This page was built for publication: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
