Incremental allocation of a discrete and convex resource to concave activities

DOI10.1007/BF01944481zbMath0483.65035MaRDI QIDQ1163341

K. M. Mjelde

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

optimal solutionincremental algorithmresource allocation problemdiscrete resource22, 257-260 (1982)concave return functions

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM
• A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
• Discrete Resource Allocation by a Branch and Bound Method
• Discrete Optimization Via Marginal Analysis

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