Technical Note—An Integer Maximization Problem

Richard E. Schwartz and Clive L. Dym
Additional contact information
Richard E. Schwartz: Institute for Defense Analyses, Arlington, Virginia
Clive L. Dym: Institute for Defense Analyses, Arlington, Virginia

Operations Research, 1971, vol. 19, issue 2, 548-550

Abstract: This note solves the following problem: For v i > 0 and 0 d V ( m 1 , …, m n ) = ∑ i =1 i = n v i (1 − d m i ) with respect to ( m 1 , …, m n ), subject to the conditions that the m i are nonnegative integers and ∑ i =1 i = n m i = M (an integer). The solution is obtained by a simple rounding procedure applied to the (well known) solution of the corresponding continuous problem.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.2.548 (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:19:y:1971:i:2:p:548-550

Access Statistics for this article

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