On the existence of solutions to the quadratic mixed-integer mean–variance portfolio selection problem

In the standard mean–variance portfolio selection approach, several operative features are not taken into account. Among these neglected aspects, one of particular interest is the finite divisibility of the (stock) assets, i.e. the obligation to buy/sell only integer quantities of asset lots whose number is pre-established. In order to consider such a feature, we deal with a suitably defined quadratic mixed-integer programming problem. In particular, we formulate this problem in terms of quantities of asset lots (instead of, as usual, in terms of capital per cent quotas). Secondly, we provide necessary and sufficient conditions for the existence of a non-empty mixed-integer feasible set of the considered programming problem. Thirdly, we present some rounding procedures for finding, in a finite number of steps, a feasible mixed-integer solution which is better than the one detected by the necessary and sufficient conditions in terms of the value assumed by the portfolio variance. Finally, we perform an extensive computational experiment by means of which we verify the goodness of our approach.