An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems

DOI10.1137/S0036144598330177zbMath0958.65058OpenAlexW2082350762MaRDI QIDQ4509764

No author found.

Publication date: 19 October 2000

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0036144598330177

zbMATH Keywords

Newton methodproduction planningrootfindingHalley methodnonlinear knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Production models (90B30) Numerical computation of solutions to single equations (65H05)

Related Items (11)

Maximum likelihood estimation of cell probabilities in constrained multinomial models ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ A penalty algorithm for solving convex separable knapsack problems ⋮ Solving nested-constraint resource allocation problems with an interior point method ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A convergent decomposition algorithm for support vector machines ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ Solving the continuous nonlinear resource allocation problem with an interior point method ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ The submodular knapsack polytope

This page was built for publication: An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems