Risk criteria in a stochastic knapsack problem

Risk criteria in a stochastic knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor19911720
Country: United States
Volume: 38
Issue: 5
Start Page Number: 820
End Page Number: 825
Publication Date: Sep 1990
Journal: Operations Research
Authors:
Keywords: networks
Abstract:

The paper considers an investor who wants to allocate funds among several projects. Each project is expected to yield a certain reward, and the objective is that a total reward will achieve a certain given amount, called the target. This problem is relatively easy to solve when rewards are deterministic, but may be hard in a more realistic setting when the rewards are stochastic and the investor wants to maximize the probability of attaining the target. The paper shows that, by combining dynamic programming with a search procedure, the stochastic version of the problem can be solved relatively fast when rewards are normally distributed. The procedure is also useful for other risk criteria, which involve both the mean and the variance of the total reward.

Reviews

Required fields are marked *. Your email address will not be published.