Minimization of Increasing Co-radiant Functions with Branch and Bound Method and Its Application in Portfolio Optimization

Document Type : Original Paper

Authors

1 Department of Applied Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.

2 Department of Mathematics, Faculty of Sciences and Modern Technologies, Graduate University of Advanced Technology, Kerman, Iran.

Abstract

The branch and bound algorithm is a widespread method for global optimization. This algorithm partitions the feasible set of the optimization problem through a branching method and then calculates an upper bound and a lower bound for each member of the partition using a bounding method. Finally, the branch and bound method compares the obtained bounds and the objective function values ​​with each other and removes the members of the partition that do not contain an optimal point. In this paper, the branch and bound algorithm for optimizing increasing co-radiant functions on subsets of $\mathbb{R}_+^n$ which are presented in the form of the intersection of a half-space with a simplex (the purpose of considering such feasible sets is to examine a model of financial mathematics, called the mean-standard deviation model). We use the concept of abstract convexity to increase co-radiant functions for bounding (finding lower bounds). In the end, as an application of this optimization problem, we propose the mean-standard deviation model of portfolio optimization and solve it with the branch and bound method.

Keywords

Main Subjects

References

[1] Abdul Razak, H.N., Maasar, M., Hafidzuddin, N.H. and Chun Lee, E.S., 2019. Portfolio optimization of risky assets using mean­variance and mean­cvar. Journal of Academia, 7, pp.25–32.
[2] Bagirov, A.M. and Rubinov, A.M., 2000. Global minimization of increasing positively homogeneous functions over the unit simplex. Ann. Oper. Res., 98, pp.171–187. doi:10.1023/A:1019204407420
[3] Best, M.J., 2010. Portfolio optimization. CRC Press.
[4] Daryaei, M.H. and Mohebi, H., 2013. Abstract convexity of extended real­valued ICR functions. Optimization, 62(6), pp.835–855. doi:10.1080/02331934.2012.741127
[5] Daryaei, M.H. and Mohebi, H., 2015. Global minimization of the difference of strictly non­positive valued affine ICR functions. J. Glob. Optim., 61, pp.311–323. doi:10.1007/s10898­014­0168­0
[6] Daryaei, M.H. and Mohebi, H., 2024. Dual optimality conditions for the difference of extended real valued increasing co­radiant functions. J. Glob. Optim., doi:10.1007/s10898­024­01404­1
[7] Dey, N., 2023. Applied Genetic Algorithm and Its Variants: Case Studies and New Developments. Springer Nature.
[8] Glover, B.M. and Rubinov, A.M., 1999. Increasing convex­along­rays functions with applications to global optimization. J. Optim. Theory. Appl., 102, pp.615–642. doi:10.1023/A:1022602223919
[9] Horst, R. and Tuy, H., 2013. Global optimization: Deterministic approaches. Springer Science &
Business Media.
[10] Martínez­Legaz, J.E., Rubinov, A.M. and Schaible, S., 2005. Increasing quasiconcave co­radiant
functions with applications in mathematical economics. Math. Methods. Oper. Res., 61(2), pp.261–
280. doi:10.1007/s001860400405
[11] Mohebi, H. and Sadeghi, H., 2009. Monotonic analysis over ordered topological vector spaces: II. Optimization, 58(2), pp.241–249. doi:10.1080/02331930701761664
[12] Nemirovski, A.S. and Todd, M.J., 2008. Interior­point methods for optimization. Acta. Numer., 17, pp.191–234. doi:10.1017/S0962492906370018
[13] Rockafellar, R.T., 1997. Convex analysis. Princeton university press.
[14] Rubinov, A.M., 2013. Abstract Convexity and Global Optimization. Springer Science & Business Media.
[15] Rubinov, A.M. and Andramonov, M.Y., 1999. Minimizing increasing star­shaped functions based on abstract convexity. J. Glob. Optim., 15, pp.19–39. doi:10.1023/A:1008344317743
[16] Sattarzadeh, A.R. and Mohebi, H., 2019. Characterizing approximate global minimizers of the
difference of two abstract convex functions with applications. Filomat, 33(8), pp.2431–2445.
doi:10.2298/FIL1908431S
[17] Silva, L.P., Alem, D. and Carvalho, F.L., 2017. Portfolio optimization using mean absolute deviation (MAD) and conditional value­at­risk (CVaR). Production, 27, doi:10.1590/0103­6513.208816
[18] Tomazella, C.P. and Nagano, M.S., 2020. A comprehensive review of Branch­and­Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem. Expert. Syst. Appl., 158, doi:10.1016/j.eswa.2020.113556
[19] Unger, A., 2014. The use of risk budgets in portfolio optimization. Springer

Files

History

  • Receive Date: 09 September 2023
  • Revise Date: 11 August 2024
  • Accept Date: 10 September 2024

Share

How to cite

Statistics