On the Optimal Allocation of Limited Resources

L. E. Ward
Additional contact information
L. E. Ward: U.S. Naval Ordnance Test Station, China Lake, California

Operations Research, 1957, vol. 5, issue 6, 815-819

Abstract: A concave programming problem is presented, which is a model for an operations-research problem arising in both military and commercial applications. It is amenable to linear programming methods and can be solved by a sequence of applications of the simplex algorithm.

Date: 1957
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.5.6.815 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:5:y:1957:i:6:p:815-819

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().