Algorithms for Separable Nonlinear Resource Allocation Problems

DOI10.1287/opre.46.2.272zbMath0979.90109OpenAlexW2167664808MaRDI QIDQ2770087

Muralidharan S. Kodialam, Hanan Luss

Publication date: 7 February 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.46.2.272

zbMATH Keywords

resource allocationsingle resource constraint

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items (20)

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions ⋮ Resource planning and allocation problem under uncertain environment ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Optimum component test plans for phased-mission systems ⋮ Nonconvex piecewise linear knapsack problems ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ The design of optimum component test plans for system reliability ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ A branch-and-bound based method for solving monotone optimization problems ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method

This page was built for publication: Algorithms for Separable Nonlinear Resource Allocation Problems