Suitable-portfolio investors,nondominated frontier sensitivity,and the effect of multiple objectives on standard portfolio selection

In standard portfolio theory, an investor is typically taken as having one stochastic objective, to maximize the random variable of portfolio return. But in this paper, we focus on investors whose purpose is to build, more broadly, a “suitable portfolio” taking additional concerns into account. Such investors would have additional stochastic and deterministic objectives that might include liquidity, dividends, number of securities in a portfolio, social responsibility, and so forth. To accommodate such investors, we develop a multiple criteria portfolio selection formulation, corroborate its appropriateness by examining the sensitivity of the nondominated frontier to various factors, and observe the conversion of the nondominated frontier to a nondominated surface. Furthermore, multiple criteria enable us to provide an explanation as to why the “market portfolio,” so often found deep below the nondominated frontier, is roughly where one would expect it to be with multiple criteria. After commenting on solvability issues, the paper concludes with the idea that what is the “modern portfolio theory” of today might well be interpreted as a projection onto two-space of a real multiple criteria portfolio selection problem from higher dimensional space. M. Hirschberger: Research conducted while a Visiting Scholar at the Department of Banking and Finance, Terry College of Business, University of Georgia, October 2003–March 2004.     

基于引力搜索和粒子群混合优化算法的证券投资组合问题研究

本文研究考虑交易成本的投资组合模型,分别以风险价值(VAR)和夏普比率(SR)作为投资组合的风险评价指标和效益评价指标。为有效求解此模型,本文在引力搜索和粒子群算法的基础上提出了一种混合优化算法(IN-GSA-PSO),将粒子群算法的群体最佳位置和个体最佳位置与引力搜索算法的加速度算子有机结合,使混合优化算法充分发挥单一算法的开采能力和探索能力。通过对算法相关参数的合理设置,算法能够达到全局搜索和局部搜索的平衡,快速收敛到模型的最优解。本文选取上证50股2014年下半年126个交易日的数据,运用Matlab软件进行仿真实验,实验结果显示,考虑交易成本的投资组合模型可使投资者得到更高的收益率。研究同时表明,基于PSO和GSA的混合算法在求解投资组合模型时比单一算法具有更好的性能,能够得到满意的优化结果。     

Multicriteria Approach to Bilevel Optimization

In this paper, we study the relationship between bilevel optimization and multicriteria optimization. Given a bilevel optimization problem, we introduce an order relation such that the optimal solutions of the bilevel problem are the nondominated points with respect to the order relation. In the case where the lower-level problem of the bilevel optimization problem is convex and continuously differentiable in the lower-level variables, this order relation is equivalent to a second, more tractable order relation. Then, we show how to construct a (nonconvex) cone for which we can prove that the nondominated points with respect to the order relation induced by the cone are also nondominated points with respect to any of the two order relations mentioned before. We comment also on the practical and computational implications of our approach.     

Portfolio Selection Problem with Minimax Type Risk Function

The investor's preference in risk estimation of portfolio selection problems is important as it influences investment strategies. In this paper a minimax risk criterion is considered. Specifically, the investor aims to restrict the standard deviation for each of the available stocks. The corresponding portfolio optimization problem is formulated as a linear program. Hence it can be implemented easily. A capital asset pricing model between the market portfolio and each individual return for this model is established using nonsmooth optimization methods. Some numerical examples are given to illustrate our approach for the risk estimation.     

On a special class of bicriterion path problems

In this paper we are concerned with a special class of bicriterion path problems. For the considered class of bicriterion problems at least one of the objectives is type MAXMIN. For the other one, besides an objective type MAXMIN also a MINSUM and a MINRATIO type objective are considered. Two algorithms are presented for the considered class of bicriterion path problems. The first one only determines the minimal complete set of nondominated paths and the second one determines the entire set of nondominated paths. Both algorithms can be used for any type of bicriterion path problems, since one of the objectives is type MAXMIN and an algorithm exists to determine the best path for the other objective. Computational statistics for the three types of considered bicriterion path problems are also presented.     

A multi-objective genetic algorithm for cardinality constrained fuzzy portfolio selection

This paper presents a new procedure that extends genetic algorithms from their traditional domain of optimization to fuzzy ranking strategy for selecting efficient portfolios of restricted cardinality. The uncertainty of the returns on a given portfolio is modeled using fuzzy quantities and a downside risk function is used to describe the investor's aversion to risk. The fitness functions are based both on the value and the ambiguity of the trapezoidal fuzzy number which represents the uncertainty on the return. The soft-computing approach allows us to consider uncertainty and vagueness in databases and also to incorporate subjective characteristics into the portfolio selection problem. We use a data set from the Spanish stock market to illustrate the performance of our approach to the portfolio selection problem.     

A new risk criterion in fuzzy environment and its application

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.     

InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem

In this paper an interactive procedure based upon a data structure called a quad tree is developed for solving the discrete alternative multiple criteria problem. Called InterQuad, the procedure has been designed with large discrete alternative problems in mind. InterQuad takes advantage of the ability of a quad tree to identify, store, and retrieve nondominated criterion vectors. Then, the user interacts with the nondominated criterion vectors stored in the quad tree in a fashion similar to that of the Combined Tchebycheff/Aspiration Criterion Vector Procedure of Steuer, Silverman and Whisman.     

Heston随机波动率市场中带VaR约束的最优投资策略

本文研究了Heston随机波动率市场下, 基于VaR约束下的动态最优投资组合问题。
假设Heston随机波动率市场由一个无风险资产和一个风险资产构成,投资者的目标为最大化其终端的期望效用。与此同时, 投资者将动态地评估其待选的投资组合的VaR风险,并将其控制在一个可接受的范围之内。本文在合理的假设下,使用动态规划的方法,来求解该问题的最优投资策略。在特定的参数范围内,利用数值方法计算出近似的最优投资策略和相应值函数, 并对结果进行了分析。     

Preference programming for robust portfolio modeling and project selection

In decision analysis, difficulties of obtaining complete information about model parameters make it advisable to seek robust solutions that perform reasonably well across the full range of feasible parameter values. In this paper, we develop the Robust Portfolio Modeling (RPM) methodology which extends Preference Programming methods into portfolio problems where a subset of project proposals are funded in view of multiple evaluation criteria. We also develop an algorithm for computing all non-dominated portfolios, subject to incomplete information about criterion weights and project-specific performance levels. Based on these portfolios, we propose a project-level index to convey (i) which projects are robust choices (in the sense that they would be recommended even if further information were to be obtained) and (ii) how continued activities in preference elicitation should be focused. The RPM methodology is illustrated with an application using real data on road pavement projects.     

投资组合模型的改进研究:基于企业社会责任视角的实证分析

在尊重和借鉴前人对企业社会责任研究,尤其是在企业社会责任评价研究基础之上,本文从投资者的角度在投资组合过程中研究企业社会责任。在Markowitz(均值—方差)理论模型上添加企业社会责任的三个一级指标期望作为目标函数,由此将传统的投资组合模型扩展为五个目标函数的投资组合选择模型,而且我们根据经济学中经典的效用函数理论证明了此模型的正确性。本文引入主流的企业社会责任评价标准,并对一些典型公司进行打分量化。在此基础之上建立了以期望回报率、回报率的方差、核心利益相关者期望、蛰伏利益相关者期望和边缘利益相关者期望为目标函数的投资组合选择模型,在最小方差曲面上选取10个点构造投资组合,并以样本外的数据验证了模型的有效性。研究发现:根据此模型计算出来的部分投资组合回报率显著高于同期的市场指数。研究结果表明,这种关注企业社会责任的多目标投资组合选择模型,不仅让投资者可以直接控制企业社会责任,而且实际数据证明了此模型的优势之处,从而为关注企业社会责任的投资者提供一种投资的方法和思路。     

On the criterion vectors of lines of portfolio selection with multiple quadratic and multiple linear objectives

As the research for portfolio selection evolves, traditional models and models with one quadratic objective and multiple linear objectives are being solved. In this paper, I propose models with multiple quadratic and multiple linear objectives. Due to the difficulty involved, I study the new models by lines in decision space, analyze the criterion vectors of the lines by projection, and approximate the nondominated sets by the criterion vectors. As an illustration, I extend Merton’s portfolio selection model, propose algorithms to approximate the nondominated sets by the criterion vectors of portfolios with cardinality 3 and then K, and demonstrate the number of the criterion vectors.     

Portfolio Optimization in a Semi-Markov Modulated Market

We address a portfolio optimization problem in a semi-Markov modulated market. We study both the terminal expected utility optimization on finite time horizon and the risk-sensitive portfolio optimization on finite and infinite time horizon. We obtain optimal portfolios in relevant cases. A numerical procedure is also developed to compute the optimal expected terminal utility for finite horizon problem. This work was supported in part by a DST project: SR/S4/MS: 379/06; also supported in part by a grant from UGC via DSA-SAP Phase IV, and in part by a CSIR Fellowship.     

Portfolio optimization with serially correlated, skewed and fat tailed index returns

This paper finds that mean-variance portfolio optimization of stocks, bonds, hedge funds, real estate investment trusts and commodities is sufficiently exact to optimize the investor’s utility. We approximate the expected utility using a Taylor series expansion including terms involving third and fourth order moments. The empirical findings for monthly data from August 1994–August 2009 suggest that the incorporation of skewness and kurtosis cause no noticeable change in the optimal portfolio allocation. However, the serial correlations of smoothed returns of hedge funds and real estate investment trusts indeed cause major changes in optimal portfolio allocation. Consequently, attention needs to be drawn to significant serial correlation and not to potential deviations from normality due to skewed and fat-tailed return distributions. The out-of-sample analysis using a moving window gives evidence that the optimal portfolio weight differ significantly considering serial correlation. The optimization using smoothed returns leads to the highest terminal wealth after 10 years. The highest utility is reached with smoothed as well as shrinked returns, while using unsmoothed as well as shrinked returns leads to an out-of-sample disaster. These findings have practical implications for investors who are willing to diversify their portfolios with hedge funds and real estate investment trusts.     

An exact method for computing the nadir values in multiple objective linear programming

In this paper we propose a new method to determine the exact nadir (minimum) criterion values over the efficient set in multiple objective linear programming (MOLP). The basic idea of the method is to determine, for each criterion, the region of the weight space associated with the efficient solutions that have a value in that criterion below the minimum already known (by default, the minimum in the payoff table). If this region is empty, the nadir value has been found. Otherwise, a new efficient solution is computed using a weight vector picked from the delimited region and a new iteration is performed. The method is able to find the nadir values in MOLP problems with any number of objective functions, although the computational effort increases significantly with the number of objectives. Computational experiments are described and discussed, comparing two slightly different versions of the method.     

标准化风险度量与投资决策的双目标优化

标准化风险度量(SRM)作为投资中的一种新的风险度量，其较传统风险度量的优点及在投资项目比较中特有的优良性质已被证明，本文导出SRM在概率意义下的一种重要的等价形式，并以此为基础建立以标准化风险(SR)为目标或约束的投资决策优化方法，该方法的核心是将以SRM为风险度量的优化问题转化为线性规划问题的优化技术，此技术结合利用统计抽样数据，可优化含有大量金融工具的投资组合，本文在考虑交易成本的情形下建立了最小化投资的标准化风险的同时最大化其期望有效回报(EER)的双目标优化模型，最后，具体考虑了上证30指数股票组合的优化以说明所建议的方法及模型的应用并实证它们的可行、合理及优良性，其中统计抽样基于近期历史数据。     

An interactive weighted Tchebycheff procedure for multiple objective programming

The procedure samples the efficient set by computing the nondominated criterion vector that is closest to an ideal criterion vector according to a randomly weighted Tchebycheff metric. Using ‘filtering’ techniques, maximally dispersed representatives of smaller and smaller subsets of the set of nondominated criterion vectors are presented at each iteration. The procedure has the advantage that it can converge to non-extreme final solutions. Especially suitable for multiple objective linear programming, the procedure is also applicable to integer and nonlinear multiple objective programs.     

Inverse conic programming with applications

Linear programming duality yields efficient algorithms for solving inverse linear programs. We show that special classes of conic programs admit a similar duality and, as a consequence, establish that the corresponding inverse programs are efficiently solvable. We discuss applications of inverse conic programming in portfolio optimization and utility function identification.     

Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes

Multiplicative programming problems (MPPs) are global optimization problems known to be NP-hard. In this paper, we employ algorithms developed to compute the entire set of nondominated points of multi-objective linear programmes (MOLPs) to solve linear MPPs. First, we improve our own objective space cut and bound algorithm for convex MPPs in the special case of linear MPPs by only solving one linear programme in each iteration, instead of two as the previous version indicates. We call this algorithm, which is based on Benson’s outer approximation algorithm for MOLPs, the primal objective space algorithm. Then, based on the dual variant of Benson’s algorithm, we propose a dual objective space algorithm for solving linear MPPs. The dual algorithm also requires solving only one linear programme in each iteration. We prove the correctness of the dual algorithm and use computational experiments comparing our algorithms to a recent global optimization algorithm for linear MPPs from the literature as well as two general global optimization solvers to demonstrate the superiority of the new algorithms in terms of computation time. Thus, we demonstrate that the use of multi-objective optimization techniques can be beneficial to solve difficult single objective global optimization problems.     

Credit risk optimization using factor models

We study portfolio credit risk management using factor models, with a focus on optimal portfolio selection based on the tradeoff of expected return and credit risk. We begin with a discussion of factor models and their known analytic properties, paying particular attention to the asymptotic limit of a large, finely grained portfolio. We recall prior results on the convergence of risk measures in this “large portfolio approximation” which are important for credit risk optimization. We then show how the results on the large portfolio approximation can be used to reduce significantly the computational effort required for credit risk optimization. For example, when determining the fraction of capital to be assigned to particular ratings classes, it is sufficient to solve the optimization problem for the large portfolio approximation, rather than for the actual portfolio. This dramatically reduces the dimensionality of the problem, and the amount of computation required for its solution. Numerical results illustrating the application of this principle are also presented. JEL Classification G11