Linear programing models for portfolio optimization using a benchmark

We consider the problem of constructing a perturbed portfolio by utilizing a benchmark portfolio. We propose two computationally efficient portfolio optimization models, the mean-absolute deviation risk and the Dantzig-type, which can be solved using linear programing. These portfolio models push the existing benchmark toward the efficient frontier through sparse and stable asset selection. We implement these models on two benchmarks, a market index and the equally-weighted portfolio. We carry out an extensive out-of-sample analysis with 11 empirical datasets and simulated data. The proposed portfolios outperform the benchmark portfolio in various performance measures, including the mean return and Sharpe ratio.