scholarly journals Cardinality Constrained Portfolio Optimization Using bee Colony Algorithm (Case Study: Tehran Stock Exchange)

2018 ◽  
Author(s):  
Masomeh Mansourinia ◽  
Alireza Momeni
Keyword(s):  
Quadratic Programming ◽  
Portfolio Optimization ◽  
Programming Problem ◽  
Efficient Solution ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Stock Exchange ◽  
Cardinality Constraints ◽  
Bee Colony ◽  
Portfolio Optimization Problem

One of the most studied variant of portfolio optimization problems is with cardinality constraints that transform classical mean-variance model from a convex quadratic programming problem into a mixed integer quadratic programming problem which brings the problem to the class of NP-Complete problems. Therefore, the computational complexity is significantly increased since cardinality constraints have a direct influence on the portfolio size. In order to overcome arising computational difficulties, for solving this problem, researchers have focused on investigating efficient solution algorithms such as metaheuristic algorithms since exact techniques may be inadequate to find an optimal solution in a reasonable time and are computationally ineffective when applied to large-scale problems. In this paper, our purpose is to present an efficient solution approach based on an artificial bee colony algorithm with feasibility enforcement and infeasibility toleration procedures for solving cardinality constrained portfolio optimization problem. Computational results confirm the effectiveness of the solution methodology. In this study, the ABC-I algorithm and the ABC-II algorithm, which are the modern meta-innovative models for solving optimization problems, have been used to optimize the investment portfolio with the goal of increasing returns and reducing risk. Of the 591 companies listed on the Tehran Stock Exchange, 150 companies were selected during the period from 2014 to 2018 using a systematic elimination method with limitation as the final sample. The data from these companies were analyzed using the algorithms used in the research and their performance was compared. The results of the research indicate that the ABC-II algorithm is more efficient than ABC-I for solving the stock portfolio optimization problem.

scholarly journals Cardinality Constrained Portfolio Optimization Using Bee Colony Algorithm (Case Study: Tehran Stock Exchange)

2018 ◽  
Author(s):  
Masomeh Mansourinia ◽  
Alireza Momeni
Keyword(s):  
Quadratic Programming ◽  
Portfolio Optimization ◽  
Programming Problem ◽  
Efficient Solution ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Stock Exchange ◽  
Cardinality Constraints ◽  
Bee Colony ◽  
Portfolio Optimization Problem

One of the most studied variant of portfolio optimization problems is with cardinality constraints that transform classical mean-variance model from a convex quadratic programming problem into a mixed integer quadratic programming problem which brings the problem to the class of NP-Complete problems. Therefore, the computational complexity is significantly increased since cardinality constraints have a direct influence on the portfolio size. In order to overcome arising computational difficulties, for solving this problem, researchers have focused on investigating efficient solution algorithms such as metaheuristic algorithms since exact techniques may be inadequate to find an optimal solution in a reasonable time and are computationally ineffective when applied to large-scale problems. In this paper, our purpose is to present an efficient solution approach based on an artificial bee colony algorithm with feasibility enforcement and infeasibility toleration procedures for solving cardinality constrained portfolio optimization problem. Computational results confirm the effectiveness of the solution methodology. In this study, the ABC-I algorithm and the ABC-II algorithm, which are the modern meta-innovative models for solving optimization problems, have been used to optimize the investment portfolio with the goal of increasing returns and reducing risk. Of the 591 companies listed on the Tehran Stock Exchange, 150 companies were selected during the period from 2014 to 2018 using a systematic elimination method with limitation as the final sample. The data from these companies were analyzed using the algorithms used in the research and their performance was compared. The results of the research indicate that the ABC-II algorithm is more efficient than ABC-I for solving the stock portfolio optimization problem.

scholarly journals The Probabilistic Risk Measure VaR as Constraint in Portfolio Optimization Problem

2021 ◽  
Vol 21 (1) ◽  
pp. 19-31
Author(s):  
Todor Stoilov ◽  
Krasimira Stoilova ◽  
Miroslav Vladimirov
Keyword(s):  
Portfolio Optimization ◽  
Value At Risk ◽  
Optimization Problem ◽  
Stock Exchange ◽  
Risk Measure ◽  
Formal Analysis ◽  
Cardinality Constraints ◽  
Algebraic Form ◽  
Portfolio Problem ◽  
Portfolio Optimization Problem

Abstract The paper realizes inclusion of probabilistic measure for risk, VaR (Value at Risk), into a portfolio optimization problem. The formal analysis of the portfolio problem illustrates the evolution of the portfolio theory in sequentially inclusion of different market characteristics into the problem. They make modifications and complications of the portfolio problem by adding various constraints to consider requirements for taxes, boundaries for assets, cardinality constraints, and allocation of the investment resources. All these characteristics and parameters of the investment participate in the portfolio problem by analytical algebraic relations. The VaR definition of the portfolio risk is formalized in a probabilistic manner. The paper applies approximation of such probabilistic constraint in algebraic form. Geometrical interpretation is given for explaining the influence of the VaR constraint to the portfolio solution. Numerical simulation with data of the Bulgarian Stock Exchange illustrates the influence of the VaR constraint into the portfolio optimization problem.

scholarly journals Kelly's Criterion in Portfolio Optimization: A Decoupled Problem

2017 ◽  
Author(s):  
Zachariah Peterson
Keyword(s):  
Differential Evolution ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Stock Exchange ◽  
Differential Evolution Algorithm ◽  
Monte Carlo Calculations ◽  
Evolution Algorithm ◽  
Portfolio Optimization Problem ◽  
Single Objective

Kelly's Criterion is well known among gamblers and investors as a method for maximizing the returns one would expect to observe over long periods of betting or investing. These ideas are conspicuously absent from portfolio optimization problems in the financial and automation literature. This paper will show how Kelly's Criterion can be incorporated into standard portfolio optimization models. The model developed here combines risk and return into a single objective function by incorporating a risk parameter. This model is then solved for a portfolio of 10 stocks from a major stock exchange using a differential evolution algorithm. Monte Carlo calculations are used to verify the accuracy of the results obtained from differential evolution. The results show that evolutionary algorithms can be successfully applied to solve a portfolio optimization problem where returns are calculated by applying Kelly's Criterion to each of the assets in the portfolio.

The Genetic Algorithm

2019 ◽  
pp. 154-178
Author(s):  
Burcu Adıguzel Mercangöz ◽  
Ergun Eroglu
Keyword(s):  
Genetic Algorithm ◽  
Mathematical Models ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Biological Evolution ◽  
Research Field ◽  
Risk Level ◽  
Important Research ◽  
Portfolio Optimization Problem

The portfolio optimization is an important research field of the financial sciences. In portfolio optimization problems, it is aimed to create portfolios by giving the best return at a certain risk level from the asset pool or by selecting assets that give the lowest risk at a certain level of return. The diversity of the portfolio gives opportunity to increase the return by minimizing the risk. As a powerful alternative to the mathematical models, heuristics is used widely to solve the portfolio optimization problems. The genetic algorithm (GA) is a technique that is inspired by the biological evolution. While this book considers the heuristics methods for the portfolio optimization problems, this chapter will give the implementing steps of the GA clearly and apply this method to a portfolio optimization problem in a basic example.

COMPLEXITY OF SCENARIO-BASED PORTFOLIO OPTIMIZATION PROBLEM WITH VaR OBJECTIVE

2002 ◽  
Vol 13 (05) ◽  
pp. 671-679 ◽  
Author(s):  
XIAOGUANG YANG ◽  
SHUO TAO ◽  
RONGJUN LIU ◽  
MAOCHENG CAI
Keyword(s):  
Portfolio Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Np Hard ◽  
Portfolio Optimization Problem

In this paper we discuss the VaR-related portfolio optimization problems. We give a scenario-based formulation of the portfolio optimization problem with VaR objective and show that the problem is NP-hard.

scholarly journals Scenario aggregation method for portfolio expectile optimization

2016 ◽  
Vol 33 (1-2) ◽  
Author(s):  
Edgars Jakobsons
Keyword(s):  
Portfolio Optimization ◽  
Value At Risk ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Risk Measures ◽  
Risk Measure ◽  
Conditional Value At Risk ◽  
Aggregation Method ◽  
Portfolio Optimization Problem ◽  
Scenario Aggregation

AbstractThe statistical functional expectile has recently attracted the attention of researchers in the area of risk management, because it is the only risk measure that is both coherent and elicitable. In this article, we consider the portfolio optimization problem with an expectile objective. Portfolio optimization problems corresponding to other risk measures are often solved by formulating a linear program (LP) that is based on a sample of asset returns. We derive three different LP formulations for the portfolio expectile optimization problem, which can be considered as counterparts to the LP formulations for the Conditional Value-at-Risk (CVaR) objective in the works of Rockafellar and Uryasev [

The Genetic Algorithm

2021 ◽  
pp. 790-810
Author(s):  
Burcu Adıguzel Mercangöz ◽  
Ergun Eroglu
Keyword(s):  
Genetic Algorithm ◽  
Mathematical Models ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Biological Evolution ◽  
Research Field ◽  
Risk Level ◽  
Important Research ◽  
Portfolio Optimization Problem

The portfolio optimization is an important research field of the financial sciences. In portfolio optimization problems, it is aimed to create portfolios by giving the best return at a certain risk level from the asset pool or by selecting assets that give the lowest risk at a certain level of return. The diversity of the portfolio gives opportunity to increase the return by minimizing the risk. As a powerful alternative to the mathematical models, heuristics is used widely to solve the portfolio optimization problems. The genetic algorithm (GA) is a technique that is inspired by the biological evolution. While this book considers the heuristics methods for the portfolio optimization problems, this chapter will give the implementing steps of the GA clearly and apply this method to a portfolio optimization problem in a basic example.

Sign in / Sign up

Export Citation Format

Share Document