Skip to main content
SpringerLink
Log in

Bounded Allocations of Discrete and Binary Resources

  • Technical Note
  • Published:
Journal of the Operational Research Society

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. The Norwegian Defence Research Establishment, Kjeller, Norway

    K. M. Mjelde

Authors
  1. K. M. Mjelde
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mjelde, K. Bounded Allocations of Discrete and Binary Resources. J Oper Res Soc 31, 949–952 (1980). https://doi.org/10.1057/jors.1980.171

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1980.171

Search

Navigation