Technical Note—Allocation of Effort Resources among Competing Activities | Zendy

Hanan Luss | Zendy; S. K. Gupta | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—Allocation of Effort Resources among Competing Activities

Author(s) -

Hanan Luss,

S. K. Gupta

Publication year - 1975

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.23.2.360

Subject(s) - resource allocation , stochastic game , optimal allocation , computer science , operations research , function (biology) , microeconomics , mathematical optimization , mathematical economics , econometrics , economics , mathematics , computer network , evolutionary biology , biology

This paper presents problems of resource allocation among many activities, such as allocating a given marketing budget among sales territories, where the return function for each territory attains different parameters. Applying the Kuhn-Tucker conditions, we derive \"single pass\" algorithms for different concave payoff functions, maximizing total returns under a given amount of available effort. Various extensions are also mentioned.

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