On Reducing a Resource Allocation Problem to a Single One-Dimensional Minimization of a Differentiable Convex Function

DOI10.2307/2581398zbMath0459.90069OpenAlexW4250418548MaRDI QIDQ3910325

Reiner Horst

Publication date: 1981

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581398

zbMATH Keywords

resource allocationoptimality conditionLagrangian dualityheuristic solutionsdifferentiable convex functionsingle one-dimensional minimizationtesting optimality

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A graphical method to solve a family of allocation problems

This page was built for publication: On Reducing a Resource Allocation Problem to a Single One-Dimensional Minimization of a Differentiable Convex Function