Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques

DOI10.1287/opre.29.3.621zbMath0456.90070OpenAlexW2073034340MaRDI QIDQ3905082

J. M. Einbu

Publication date: 1981

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

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

zbMATH Keywords

convergenceKuhn-Tucker conditionsfirst order approximation techniquesLuss-Gupta resource allocation algorithmrecurrence processreturn functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (3)

A survey on the continuous nonlinear resource allocation problem ⋮ Discrete resource allocation with tree constraints by an incremental method ⋮ Order transmission efficiency optimization in hierarchical organizations

This page was built for publication: Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques