Discrete Resource Allocation with Non-Decreasing Return and Cost Functions

DOI10.1080/02522667.1983.10698756zbMATH Open0517.90054OpenAlexW2011582848MaRDI QIDQ3666596FDOQ3666596

Authors: K. M. Mjelde 

Publication date: 1983

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1983.10698756

zbMATH Keywords

lower and upper boundsincremental algorithmdiscrete resource allocationnon-decreasing return functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites Work

• Discrete Optimization Via Marginal Analysis
• A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
• Title not available (Why is that?)
• An Algorithm for Solving a Resource Allocation Problem

This page was built for publication: Discrete Resource Allocation with Non-Decreasing Return and Cost Functions

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