A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems

He, F. and Qu, R. 2014. A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems . Information Sciences. 289, pp. 190-205. doi:10.1016/j.ins.2014.08.028

Title A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems
AuthorsHe, F. and Qu, R.
Abstract

In this paper, we investigate a multi-period portfolio selection problem with a comprehensive set of real-world trading constraints as well as market random uncertainty in terms of asset prices. We formulate the problem into a two-stage stochastic mixed-integer program (SMIP) with recourse. The set of constraints is modelled as mixed-integer program, while a set of decision variables to rebalance the portfolio in multiple periods is explicitly introduced as the recourse variables in the second stage of stochastic program. Although the combination of stochastic program and mixed-integer program leads to computational challenges in finding solutions to the problem, the proposed SMIP model provides an insightful and flexible description of the problem. The model also enables the investors to make decisions subject to real-world trading constraints and market uncertainty.

To deal with the computational difficulty of the proposed model, a simplification and hybrid solution method is applied in the paper. The simplification method aims to eliminate the difficult constraints in the model, resulting into easier sub-problems compared to the original one. The hybrid method is developed to integrate local search with Branch-and-Bound (B&B) to solve the problem heuristically. We present computational results of the hybrid approach to analyse the performance of the proposed method. The results illustrate that the hybrid method can generate good solutions in a reasonable amount of computational time. We also compare the obtained portfolio values against an index value to illustrate the performance and strengths of the proposed SMIP model. Implications of the model and future work are also discussed.

Keywords Stochastic programming; Hybrid algorithm; Branch-and-Bound; Local search; Portfolio selection problems
JournalInformation Sciences
Journal citation289, pp. 190-205
ISSN0020-0255
Year2014
PublisherElsevier
Digital Object Identifier (DOI)doi:10.1016/j.ins.2014.08.028

Related outputs

Modelling the Home Health Care Nurse Scheduling Problem for Patients with Long-Term Conditions in the UK
He, F., Chaussalet, T.J. and Qu, R. Modelling the Home Health Care Nurse Scheduling Problem for Patients with Long-Term Conditions in the UK. 33rd International ECMS Conference on modelling and Simulation. Universita degli Studi della Campania, Caserta, Area of Napoli, Italy 11 - 14 Jun 2019

Hybridising local search with Branch-and-Bound for constrained portfolio selection problems
He, F. and Qu, R. 2016. Hybridising local search with Branch-and-Bound for constrained portfolio selection problems. 30th European Conference on Modelling and Simulation (ECMS 2016). Regensburg, Germany 31 May - 01 Jun 2016

A compromise based fuzzy goal programming approach with satisfaction function for multi-objective portfolio selection
He, F., Qu, R. and John, R. 2015. A compromise based fuzzy goal programming approach with satisfaction function for multi-objective portfolio selection. 29th European Conference on Modelling and Simulation (ECMS 2015). Albena, Bulgaria 26 - 29 May 2015

A Hybrid Genetic Algorithm for a Two-Stage Stochastic Portfolio Optimization With Uncertain Asset Prices
Cui, T., Bai, R., Parkes, A., He, F., Qu, R. and Li, J. 2015. A Hybrid Genetic Algorithm for a Two-Stage Stochastic Portfolio Optimization With Uncertain Asset Prices. IEEE Congress on Evolutionary Computation (IEEE CEC). Sendai, Japan 25 - 28 May 2015 IEEE . doi:10.1109/CEC.2015.7257198

A Constraint Programming based column generation approach to nurse rostering problems
He, F. and Qu, R. 2012. A Constraint Programming based column generation approach to nurse rostering problems. Computers and Operations Research. 39 (12), pp. 3331-3343. doi:10.1016/j.cor.2012.04.018

A constraint-directed local search approach to nurse rostering problems
He, F. and Ru, Rong 2009. A constraint-directed local search approach to nurse rostering problems. 15th International Conference on Principles and Practice of Constraint Programming (CP’09). Lisbon, Portugal

Hybridizing Integer Programming models with an adaptive decomposition approach for exam timetabling problems
He, F. 2009. Hybridizing Integer Programming models with an adaptive decomposition approach for exam timetabling problems. 4th Multidisciplinary International Scheduling Conference (MISTA2009). Dublin 10 - 12 Aug 2009

A hybrid Constraint Programming approach for nurse rostering problems
He, F. 2008. A hybrid Constraint Programming approach for nurse rostering problems. AI-2008 Twenty-Eighth SGAI International Conference on Artificial Intelligence. Cambridge 09 - 11 Dec 2008

Permalink - https://westminsterresearch.westminster.ac.uk/item/9v25y/-a-two-stage-stochastic-mixed-integer-program-modelling-and-hybrid-solution-approach-to-portfolio-selection-problems


Share this
Tweet
Email