Abstract
Mjelde described methods for the solution of problems of the allocation of discrete resources with binary effectiveness values of 0 or 1 against activities with concave return functions. This note extends these methods to problems with upper bounds on certain sums of allocation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.