Portfolio Management Strategies using Knapsack Programming.

Publication Date: 17/05/2024

DOI: 10.52589/AJMSS-LHIDP7KN


Author(s): Joy Ijeoma Adindu-Dick.

Volume/Issue: Volume 7 , Issue 2 (2024)



Abstract:

One of the major tasks in portfolio management is to determine the number of stocks with relatively high net value on the stock market. This work presents a knapsack based portfolio selection model that considers the expected returns, prices and budget. It represents a typical resource allocation model in which limited resource is apportioned among a finite number of stocks. The objective is to maximize an associated return function. The work is implemented for some numerical data to illustrate the application of the model and demonstrate the effectiveness of the designed algorithm. Numerical results have shown that the optimization model yields promising results.


Keywords:

Portfolio management, Knapsack programming, Integer linear programming, Backward recursive equation.


No. of Downloads: 0

View: 75




This article is published under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
CC BY-NC-ND 4.0