A difference of convex formulation of value-at-risk constrained optimization

In this article, we present a representation of value-at-risk (VaR) as a difference of convex (D.C.) functions in the case where the distribution of the underlying random variable is discrete and has finitely many atoms. The D.C. representation is used to study a financial risk-return portfolio selection problem with a VaR constraint. A branch-and-bound algorithm … Read more