z-logo
open-access-imgOpen Access
Technical Note—An Integer Maximization Problem
Author(s) -
Richard Evan Schwartz,
Clive L. Dym
Publication year - 1971
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.19.2.548
Subject(s) - rounding , integer (computer science) , combinatorics , mathematics , simple (philosophy) , maximization , discrete mathematics , mathematical optimization , computer science , philosophy , epistemology , programming language , operating system
This note solves the following problem: For vi > 0 and 0 d Vm1, ', mn = ∑i=1i=nvi1-dmi with respect to m1, ', mn, subject to the conditions that the mi are nonnegative integers and ∑i=1i=nmi = M an integer. The solution is obtained by a simple rounding procedure applied to the well known solution of the corresponding continuous problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom