Optimal Portfolio Insurance under Nonlinear Transaction Costs

The minimization of the costs related to portfolio insurance is a very important investment strategy. In this article, by adding the transaction costs to the classical minimum cost portfolio insurance (MCPI) problem, we define and study the MCPI under transaction costs (MCPITC) problem as a nonlinear programming (NLP) problem. In this way, the MCPI problem becomes more realistic. Since such NLP problems are commonly solved by heuristics, we use the Beetle Antennae Search (BAS) algorithm to provide a solution to the MCPITC problem. Numerical experiments and computer simulations in real-world data sets confirm that our approach is an excellent alternative to other evolutionary computation algorithms.