不允许卖空限制下跳-扩散模型的均值-方差策略选择

均值-方差投资策略问题一般是在连续模型下研究的,本文建立了跳-扩散模型下的均值-方差投资选择问题,利用动态规划原理和凸分析得到了最优投资策略和有效边界的解析表达式。本文得到的最优投资策略和有效边界均是在不允许卖空限制下的,通过数值例子分析了交易限制对投资策略和有效边界的影响.     

基于可信性分布的投资组合问题的一种混合智能方法

研究了模糊环境下基于效用函数的有效资产投资组合的收益率模型,模型建立在可信性分布的基础上,而不是概率分布或可能性分布基础上.给出模糊环境下基于可信性分布的n种资产的最优投资组合问题的混合智能算法以寻找某种效用函数意义下的最优组合.并以实例仿真说明该方法的有效性.     

基于均值-方差准则的保险公司最优投资策略

研究了保险公司在均值-方差准则下的最优投资问题,其中保险公司的盈余过程由带随机扰动的Cramer-Lundberg模型刻画,而且保险公司可将其盈余投资于无风险资产和一种风险资产.利用随机动态规划方法,通过求解相应的HJB方程,得到了均值方差模型的最优投资策略和有效前沿.最后,给出了数值算例说明扰动项对有效前沿的影响.     

选择资产组合的EP-MV模型及最优解的解析表示

本文提出了存在无风险资产贷出或借入时的有效投资组合模型(EP-MV模型)，研究了不允许卖空(投资比例非负)约束条件下，EP-MV优化模型的算法，给出了有效投资组合投资比例的解析表示．在资产收益由多因素模型产生的基础上，得到了资产与有效投资组合的期望收益及风险的估计，便于实际应用．     

非正定方差阵下的证券组合投资模型研究

研究了非正定方差阵下,证券组合投资模型的最优投资比例系数的计算,有效边界,冗余证券的数量以及套利机会.从而为实证分析提供了理论依据和方法.     

均值-方差准则下的多期最优保险投资(英文)

近年来,最优保险投资问题吸引了越来越多的注意。一般这个问题是在连续时间框架下来研究的。本文针对这一问题建立离散时间的最优控制模型。应用动态规划原理求解模型对应的近似问题,得到了最优投资策略和投资有效边界的解析表达形式。本文得到的最优投资策略和投资有效边界均依赖于承保参数。通过数值例子分析了承保参数对最优投资策略和有效边界的影响。     

共同基金和无风险资产投资的最优策略

利用均值-方差模型,分析了非线性交易成本下的共同基金与无风险资产投资组合的有效边界和在一般的效用函数下讨论了投资者的最优投资策略.     

推广的半绝对离差和动态投资组合选择

在标准的Black－Scholes型金融市场下，建立了以推广的半绝对离差（Extended Semi－Absolute Deviation；ESAD）度量风险的动态均值-ESAD投资组合选择模型，研究了模型的求解方法，得到了最优投资组合策略和均值-ESAD有效前沿的解析表达式．同时，与动态均值-方差模型作了比较分析．最后，结合实例说明了模型的求解方法．     

保险公司的最优投资策略选择

保险公司传统的投资模型只允许保险公司在保费收取与赔付之间的时滞范围内投资,即投资期间不收取保费也不允许任何赔付发生。本文研究的模型克服了传统模型的不足,投资期间可以收取保费也可以接受索赔。模型在保证保险公司实现目标收益的条件下,使得公司面临的风险最小。另外在模型中引进一个安全投资比例,即保险公司以此比例的财富用于风险投资是相对安全的。通过求解模型,得到保险公司的最优投资策略和风险最小情况下用于投资的财富的比率,并讨论了保费、索赔对投资的影响;另外还得到保险公司投资组合的有效边界,并讨论了有效边界的动态性质;最后用实际数据对保险公司如何选择安全投资比例、如何分配投资资金进行了模拟。     

求解带有交易费的CVaR投资组合模型的L-S算法

本文假设投资者是风险厌恶型,用CVaR作为测量投资组合风险的方法.在预算约束的条件下,以最小化CVaR为目标函数,建立了带有交易费用的投资组合模型.将模型转化为两阶段补偿随机优化模型,构造了求解模型的随机L-S算法.为了验证算法的有效性,用中国证券市场中的股票进行数值试验,得到了最优投资组合、VaR和CVaR的值.而且对比分析了有交易费和没有交易费的最优投资组合的不同,给出了相应的有效前沿.     

Convexity and decomposition of mean-risk stochastic programs

Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing risk in decision making problems is to consider a weighted mean-risk objective, where some dispersion statistic is used as a measure of risk. We investigate the computational suitability of various mean-risk objective functions in addressing risk in stochastic programming models. We prove that the classical mean-variance criterion leads to computational intractability even in the simplest stochastic programs. On the other hand, a number of alternative mean-risk functions are shown to be computationally tractable using slight variants of existing stochastic programming decomposition algorithms. We propose decomposition-based parametric cutting plane algorithms to generate mean-risk efficient frontiers for two particular classes of mean-risk objectives.     

基于随机参照点的均值-风险分析

本文依据参照依赖偏好模型提出了基于随机参照点的风险度量方法,进而构建了均值-风险模型,并讨论了该决策方法与随机占优之间的一致性。研究发现,该决策方法不仅与一级随机占优是一致的而且与二级随机占优也是一致的。由于二级随机占优与期望效用理论的一致性,因而所构建的均值-风险模型与期望效用理论也是一致的。     

A risk-averse newsvendor with law invariant coherent measures of risk

For general law invariant coherent measures of risk, we derive an equivalent representation of a risk-averse newsvendor problem as a mean-risk model. We prove that the higher the weight of the risk functional, the smaller the order quantity. Our theoretical results are confirmed by sample-based optimization.     

Postoptimality for mean-risk stochastic mixed-integer programs and its application

The mean-risk stochastic mixed-integer programs can better model complex decision problems under uncertainty than usual stochastic (integer) programming models. In order to derive theoretical results in a numerically tractable way, the contamination technique is adopted in this paper for the postoptimality analysis of the mean-risk models with respect to changes in the scenario set, here the risk is measured by the lower partial moment. We first study the continuity of the objective function and the differentiability, with respect to the parameter contained in the contaminated distribution, of the optimal value function of the mean-risk model when the recourse cost vector, the technology matrix and the right-hand side vector in the second stage problem are all random. The postoptimality conclusions of the model are then established. The obtained results are applied to two-stage stochastic mixed-integer programs with risk objectives where the objective function is nonlinear with respect to the probability distribution. The current postoptimality results for stochastic programs are improved.     

Deviation Measures in Linear Two-Stage Stochastic Programming

We consider a linear two-stage stochastic program. Whereas optimization in the traditional setting is based solely on expectation, we include risk measures reflecting dispersions of the random objective. Presenting the mean-risk models, we aim to extend existing results for the expectation-based model. In particular, we discuss structural properties such as continuity, differentiability and convexity and address stability issues. Furthermore, we propose algorithmic treatment with a slight variation of the L-shaped method     

Mean-risk model for uncertain portfolio selection

This paper discusses the uncertain portfolio selection problem when security returns cannot be well reflected by historical data. It is proposed that uncertain variable should be used to reflect the experts’ subjective estimation of security returns. Regarding the security returns as uncertain variables, the paper introduces a risk curve and develops a mean-risk model. In addition, the crisp form of the model is provided. The presented numerical examples illustrate the application of the mean-risk model and show the disaster result of mistreating uncertain returns as random returns.     

Polymatroids and mean-risk minimization in discrete optimization

We study discrete optimization problems with a submodular mean-risk minimization objective. For 0–1 problems a linear characterization of the convex lower envelope is given. For mixed 0–1 problems we derive an exponential class of conic quadratic valid inequalities. We report computational experiments on risk-averse capital budgeting problems with uncertain returns.     

From stochastic dominance to mean-risk models: Semideviations as risk measures

Two methods are frequently used for modeling the choice among uncertain outcomes: stochastic dominance and mean-risk approaches. The former is based on an axiomatic model of risk-averse preferences but does not provide a convenient computational recipe. The latter quantifies the problem in a lucid form of two criteria with possible trade-off analysis, but cannot model all risk-averse preferences. In particular, if variance is used as a measure of risk, the resulting mean–variance (Markowitz) model is, in general, not consistent with stochastic dominance rules. This paper shows that the standard semideviation (square root of the semivariance) as the risk measure makes the mean-risk model consistent with the second degree stochastic dominance, provided that the trade-off coefficient is bounded by a certain constant. Similar results are obtained for the absolute semideviation, and for the absolute and standard deviations in the case of symmetric or bounded distributions. In the analysis we use a new tool, the Outcome–Risk (O–R) diagram, which appears to be particularly useful for comparing uncertain outcomes.     

Dynamic mean-risk optimization in a binomial model

We consider a dynamic mean-risk problem, where the risk constraint is given by the Average Value–at–Risk. As financial market we choose a discrete-time binomial model which allows for explicit solutions. Problems where the risk constraint on the final wealth is replaced by intermediate risk constraints are also considered. The problems are solved with the help of the theory of Markov decision models and a Lagrangian approach.     

Integer programming approaches in mean-risk models

This paper is concerned with porfolio optimization problems with integer constraints. Such problems include, among others mean-risk problems with nonconvex transaction cost, minimal transaction unit constraints and cardinality constraints on the number of assets in a portfolio. These problems, though practically very important have been considered intractable because we have to solve nonlinear integer programming problems for which there exists no efficient algorithms. We will show that these problems can now be solved by the state- of-the-art integer programming methodologies if we use absolute deviation as the measure of risk.