A relaxation algorithm for building undominated portfolios

Stochastic dominance methods which have been developed in recent years are generally more valid than mean-variance (EV) and higher moment methods for selecting a portfolio from a given finite set of possible portfolios. One of the limitations of these methods is the lack of procedures for building portfolios from a given set of securities and the probability distribution of their returns. Markowitz has developed an algorithm based on the restriction method in linear programming to build undominated portfolios. In this paper a more efficient method based on the relaxation method of linear programming is developed and tested for efficiency. Computational results justify its use as a practical tool for portfolio building.