Simple Ranking Methods for Allocation of One Resource

This paper considers optimization problems with a nonlinear-additive objective function and a single linear constraint. Such models have numerous direct applications and serve as subproblems in procedures for more complex problems. Some important portfolio selection problems can be expressed in this...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Management science Ročník 26; číslo 1; s. 34 - 43
Hlavní autor: Zipkin, Paul H
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.01.1980
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Edice:Management Science
Témata:
ISSN:0025-1909, 1526-5501
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers optimization problems with a nonlinear-additive objective function and a single linear constraint. Such models have numerous direct applications and serve as subproblems in procedures for more complex problems. Some important portfolio selection problems can be expressed in this form, and the problem also arises in economic theory. Several authors have noticed independently that special cases and variants of the problem can be solved exactly by surprisingly simple, finite algorithms. The major purpose of this paper is to present these results in a unified framework, which then permits substantial generalizations and extensions. The results lend themselves to an appealing managerial interpretation, similar to the rate-of-return cutoff rules of capital budgeting.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.26.1.34