基于模糊决策的投资组合优化

基于模糊决策理论研究了带有成比例交易费用的证券投资组合优化问题. 首先,基于半绝对偏差风险函数和极大极小原则提出了一种新的风险函数--极大极小半绝对偏差风险函数;然后, 引入一种非线性隶属函数更加形象地描述了投资者对投资收益和投资风险的满意程度;在此基础上, 进一步提出了非线性满意程度的模糊决策投资组合选择模型;最后, 针对提出的模型,利用中国证券市场的真实数据给出了数值算例.     

半绝对偏差投资组合模型构建及其应用

通过对模糊隶属函数以及基金投资组合基本模型的适当变形,构建了带交易费及流动性约束的极大极小-半绝对偏差投资组合模型.选取5支证券,依据2008年全年的数据作为样本数据,按投资者的不同偏好得出不同的最优投资策略,并对几种情形进行了对比,结果显示此模型能很好地反映出投资者的主观意愿,具有很好的灵活性.     

摩擦市场的均值-离差证券组合选择模型

本文给出了基于历史收益率数据的均值 -平均绝对离差型证券组合投资模型 .该模型采用收益的平均绝对离差作为风险的尺度 ,可以通过求解线性规划来获的摩擦市场 (如具有税收和交易费 )最优投资组合 ,避免了均值 -方差模型求解二次规划的复杂性 .     

模糊环境中带交易费用的投资组合策略问题

由于金融市场是波动的,风险资产的预期收益率由于很多不确定性是很难估计的,本文考虑预期收益率是可能性分布(模糊数),并且在此基础上用模糊数的可能性均值表示投资组合的收益,用模糊数的平均绝对偏差表示风险,考虑了交易费用后,得到投资组合模型,最后给出了数值计算的例子.     

限制卖空的不确定多阶段均值-绝对偏差投资组合决策

为了处理主观不确定性,本文运用模糊不确定性来衡量投资组合收益率的均值和绝对偏差。考虑一系现实约束条件,构建了限制卖空的不确定多阶段均值-绝对偏差的投资组合模型,并运用离散近似迭代法求解。通过实证研究分别对风险资产卖空比例、风险值和熵值进行灵敏性分析,验证模型和算法的有效性。     

具有交易成本的多阶段M-AAD模糊投资组合优化

考虑交易成本、交易量的阀值约束和熵约束,提出均值-平均绝对偏差(M-AAD)多阶段的模糊投资组合模型。模型中的收益水平由模糊收益的均值确定,其风险水平由模糊收益的绝对偏差确定,熵度量投资组合的多样化程度。由于存在交易成本,该模型是一个具有路径依赖性的动态优化问题。提出离散近似迭代法求解。最后,以具体的算例比较不同熵约束下最优投资组合策略,并验证模型的算法和有效性。     

带交易费的最优投资组合选择的极大极小方法

研究不允许卖空时不相关资产的最优投资选择问题.在风险资产收益率不能确切知道的情况下,建立了投资组合选择问题的极大极小模型.将交易费引入到极大极小模型中,交易费假定为新旧投资组合之差的V型函数.推导出有效投资组合与有效前沿的解析表达式.     

均值-半绝对偏差区间投资组合绩效评价

本文构建了考虑现实约束的均值-半绝对偏差区间投资组合优化模型。由于存在实际投资约束,如交易成本、交易量限制和借款限制,投资组合优化模型相对复杂,不易获得真实前沿面的解析解,使得投资组合理论的应用难度加大。为了求解模型,引入DEA方法,构建均值-半绝对偏差区间投资组合DEA评价模型,通过构造前沿面来逼近真实前沿面。最后,使用上海证券市场的实际数据验证了本文方法的合理性与可行性。     

多阶段均值-半绝对偏差模糊投资组合优化研究

考虑交易成本和交易量限制,提出投资组合的收益率的隶属函数为梯形的多阶段均值-半绝对偏差可能性投资组合模型,并用自创算法——离散近似迭代法求解.其基本思路为:将连续型状态变量离散化,根据网络图的构造方法将上述模型转化多阶段赋权有向图;运用极大代数求出起点至终点的最长路程,即获得模型的一个可行解;以该可行解为基础,继续迭代直到前后两个可行解非常接近.文章还证明了该方法的线性收敛.最后,文章以一个具体的算例验证了该算法的有效性.     

不同风险度量方法的投资组合比较研究

为了验证投资组合理论在中国证券市场的有效性,在不允许卖空情况,针对不同风险度量方法,文章运用旋转算法或结合序列二次规划法分别求解均值-方差、均值-下半方差投资组合模型、均值-半绝对偏差、均值-平均绝对偏差和均值-VaR.文章选取三年沪市六只业绩比较好的股票,依据前两年的数据作为样本数据,分别求出五个模型在不同期望收益率下的最优投资策略,将得出的最优投资策略应用到最后一年,进行模拟投资,从而计算出各模型的总收益率.以等比例投资为标准,比较五个模型的绩效.最后,证明了两个模型对于中国证券市场是适用.     

Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized (θ, η, ρ)-V-invex functions and arbitrary norms

The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized(θ, η, ρ)-V-invexity assumptions for a discrete minmax fractional programming problem involving arbitrary norms.     

Parametric duality models for discrete minmax fractional programming problems containing generalized (θ,η,ρ)-V- invex functions and arbitrary norms

The purpose of this paper is to construct several parametric duality models and prove appropriate duality results under various generalized (θ,η,ρ)-V-invexity assumptions for a discrete minmax fractional programming problem involving arbitrary norms.     

Portfolio selection with a minimax measure in safety constraint

In this paper, we attempt to design a portfolio optimization model for investors who desire to minimize the variation around the mean return and at the same time wish to achieve better return than the worst possible return realization at every time point in a single period portfolio investment. The portfolio is to be selected from the risky assets in the equity market. Since the minimax portfolio optimization model provides us with the portfolio that maximizes (minimizes) the worst return (worst loss) realization in the investment horizon period, in order to safeguard the interest of investors, the optimal value of the minimax optimization model is used to design a constraint in the mean-absolute semideviation model. This constraint can be viewed as a safety strategy adopted by an investor. Thus, our proposed bi-objective linear programming model involves mean return as a reward and mean-absolute semideviation as a risk in the objective function and minimax as a safety constraint, which enables a trade off between return and risk with a fixed safety value. The efficient frontier of the model is generated using the augmented -constraint method on the GAMS software. We simultaneously solve the ratio optimization problem which maximizes the ratio of mean return over mean-absolute semideviation with same minimax value in the safety constraint. Subsequently, we choose two portfolios on the above generated efficient frontier such that the risk from one of them is less and the mean return from other portfolio is more than the respective quantities of the optimal portfolio from the ratio optimization model. Extensive computational results and in-sample and out-of-sample analysis are provided to compare the financial performance of the optimal portfolios selected by our proposed model with that of the optimal portfolios from the existing minimax and mean-absolute semideviation portfolio optimization models on real data from S&P CNX Nifty index.     

广义I型连通级小极大分式问题的对偶

在I型弧连通和广义I型弧连通假设下,建立了极大极小分式优化问题的对偶模型,并提出了弱对偶定理、强对偶定理和严格逆对偶定理.     

Comments on properties of the minmax solutions in goal programming

This note discusses the properties of solutions generated by the minmax models of goal programming (GP) and compromise programming (CP). GP approaches use a certain target point in the criterion (attribute) space to model decision maker's preferences. When the ideal (utopia) point is used as the target, the minmax GP model coincides with the minmax (Chebyshev) CP model. In a recent review of the current GP state-of-the-art, there have been included suggestions that the two equivalent models ensure Pareto efficiency of solutions and they guarantee a perfectly balanced allocation among the achievement of the individual targets. In this note, it is shown that the models, in general, do not ensure the efficiency of solutions and they do not guarantee the perfect equity among the individual achievements. Moreover, there are given sufficient and necessary conditions clarifying when the discussed properties of minmax solutions do occur.     

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions

In this paper we present four sets of saddle-point-type optimality conditions, construct two Lagrangian-type dual problems, and prove weak and strong duality theorems for a discrete minmax fractional subset programming problem. We establish these optimality and duality results under appropriate (b,?,ρ,θ)-convexity hypotheses.     

Distribution Free Procedures for Some Inventory Models

Stochastic inventory models, such as continuous review models and periodic review models, require information on the lead time demand. However, information about the form of the probability distribution of the lead time demand is often limited in practice. We relax the assumption that the cumulative distribution function, say F, of the lead time demand is completely known and merely assume that the first two moments of F are known and finte. The minmax distribution free approach for the inventory model consists of finding the most unfavourable distribution for each decision variable and then minimizing over the decision variable. We solve both the continuous review model and the periodic review model with a mixture of backorders and lost sales using the minmax distribution free approach.     

Improved load balancing and resource utilization for the Skill Vehicle Routing Problem

The Skill Vehicle Routing Problem (Skill VRP) considers vehicle routing under the assumption of skill requirements given on demand nodes. These requirements have to be met by the serving vehicles. No further constraints, like capacity or cost restrictions, are imposed. Skill VRP solutions may show a tendency to have a bad load balancing and resource utilization. In a majority of solutions only a subset of vehicles is active. Moreover, a considerable share of demand nodes is served by vehicles that have a skill higher than necessary. A reason for that solution behavior lies in the model itself. As no resource restrictions are imposed, the Skill VRP tends to produce TSP-like solutions. To obtain better balanced solutions, we introduce two new approaches. First we propose a minmax model that aims at minimizing the maximal vehicle tour length. Second we suggest a two-step method combining the minmax approach with a distance constrained model. Our experiments illustrate that these approaches lead to improvements in load balancing and resource utilization, but, with different impact on routing costs.     

Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems

We consider the problem of obtaining integer solutions to a minmax linear programming problem. Although this general problem is NP-complete, it is shown that a restricted version of this problem can be solved in polynomial time. For this restricted class of problems two polynomial time algorithms are suggested, one of which is strongly polynomial whenever its continuous analogue and an associated linear programming problem can be solved by a strongly polynomial algorithm. Our algorithms can also be used to obtain integer solutions for the minmax transportation problem with an inequality budget constraint. The equality constrained version of this problem is shown to be NP-complete. We also provide some new insights into the solution procedures for the continuous minmax linear programming problem.     

On minquantile and maxcovering optimisation

In this paper we introduce the parametric minquantile problem, a weighted generalisation ofkth maximum minimisation. It is shown that, under suitable quasiconvexity assumptions, its resolution can be reduced to solving a polynomial number of minmax problems.It is also shown how this simultaneously solves (parametric) maximal covering problems. It follows that bicriteria problems, where the aim is to both maximize the covering and minimize the cover-level, are reducible to a discrete problem, on which any multiple criteria method may be applied.Corresponding author.Visiting researcher at the Center for Industrial Location of the Vrije Universiteit Brussel during this research.