Incremental allocation of a discrete and convex resource to concave activities

DOI10.1007/BF01944481MaRDI QIDQ1163341zbMATH OpenFDO

Authors K. M. Mjelde

Publication date 1982

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01944481

zbMATH Keywords

22, 257-260 (1982)concave return functionsdiscrete resourceincremental algorithmoptimal solutionresource allocation problem

Mathematics Subject Classification ID

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

Cites work

• A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
• ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM
• Discrete Optimization Via Marginal Analysis
• Discrete Resource Allocation by a Branch and Bound Method
• scientific article; zbMATH DE number 3807359 (Why is no real title available?)

Cited in

(3)

• Allocation of dependent divisional resources
• Discrete allocation of a linear resource according to a sum-of-products objective
• Inspection and maintenance optimization methods

This page was built for publication: Incremental allocation of a discrete and convex resource to concave activities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1163341)