4.7 Article

A new risk criterion in fuzzy environment and its application

Journal

APPLIED MATHEMATICAL MODELLING
Volume 36, Issue 7, Pages 3001-3022

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2011.09.081

Keywords

Risk measure; Absolute semi-deviation; Fuzzy portfolio optimization; Fractional programming; Pseudo-convexity; Domain decomposition method

Funding

  1. Natural Science Foundation of Hebei Province [A2011201007]
  2. Annual Foundation of Social Science Research of Hebei Colleges Universities [SKZD2011302]
  3. National Natural Science Foundation of China [60974134]

Ask authors/readers for more resources

Since the observed values of security returns in real-world problems are sometimes imprecise or vague, an increasing effort in research is devoted to study the properties of risk measures in fuzzy portfolio optimization problems. In this paper, a new risk measure is suggested to gauge the risk resulted from fuzzy uncertainty. For this purpose, the absolute deviation and absolute semi-deviation are first defined for fuzzy variable by nonlinear fuzzy integrals. To compute effectively the absolute semi-deviations of single fuzzy variable as well as its functions, this paper discusses the methods of computing the absolute semi-deviation by classical Lebesgue-Stieltjes (L-S) integral. After that, several useful absolute deviation and absolute semi-deviation formulas are established for common triangular, trapezoidal and normal fuzzy variables. Applying the absolute semi-deviation as a new risk measure in portfolio optimization, three classes of fuzzy portfolio optimization models are developed by combining the absolute semi-deviation with expected value operator and credibility measure. Based on the analytical representation of absolute semi-deviations, the established fuzzy portfolio selection models can be turned into their equivalent piecewise linear or fractional programming problems. Since the absolute semi-deviation is a piecewise fractional function and pseudo-convex on the feasible subregions of deterministic programming models, we take advantage of the structural characteristics to design a domain decomposition method to separate a deterministic programming problem into three convex subproblems, which can be solved by conventional solution methods or general-purpose software. Finally, some numerical experiments are performed to demonstrate the new modeling idea and the effectiveness of the solution method. (C) 2011 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available