首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
研究完全市场下基于二次效用最大化的带有随机资金流的动态投资组合选择问题,其中假设无风险利率、股票收益率和波动率矩阵都是一致有界随机过程.通过应用线性二次控制方法和向后随机微分方程理论得到了最优投资组合的解析表达式.  相似文献   

2.
指数化投资使投资者享有市场平均收益水平,具有投资风险分散化、投资组合透明化、投资成本低廉等优势,日益受到投资者的亲睐。由于通常指数化投资者不愿意承担较大风险,本文考虑极小化跟踪误差与投资组合的风险之和(其中风险用风险资产的累积方差来衡量)。本文证明了无论是连续时间或离散时间、有限时区或无限时区的情形,在一定的条件下,最优控制都唯一存在,即利用随机线性二次最优控制进行指数化投资,最优投资策略都唯一存在。  相似文献   

3.
现实的金融市场上,当有重大信息出现时,会对股价产生冲击,使得股价产生跳跃,同时投资过程会有随机资金流的介入,考虑股价出现跳跃与随机资金流介入的投资组合优化问题,通过构造倒向-前向随机微分方程并结合随机最优控制理论研究了一般效用函数下的投资组合选择问题,获得最优投资组合策略,然后针对二次效用函数,给出显式表示的最优投资组合策略.  相似文献   

4.
杨鹏  王震  孙卫 《经济数学》2016,(1):25-29
研究了均值-方差准则下,具有负债的随机微分博弈.研究目标是:在终值财富的均值等于k的限制下,在市场出现最坏的情况下找到最优的投资策略使终值财富的方差最小.即:基于均值-方差随机微分博弈的投资组合选择问题.使用线性-二次控制的理论解决了该问题,获得了最优的投资策略、最优市场策略和有效边界的显示解.并通过对所得结果进行进一步分析,在经济上给出了进一步的解释.通过本文的研究,可以指导金融公司在面临负债和金融市场情况恶劣时,选择恰当的投资策略使自身获得一定的财富而面临的风险最小.  相似文献   

5.
常浩  常凯 《应用概率统计》2012,28(3):301-310
研究随机利率环境下基于效用最大化的动态投资组合,并假设利率是服从Ho-Lee利率模型和Vasicek利率模型的随机过程.应用动态规划原理得到值函数满足的HJB方程,并应用Legendre变换得到其对偶方程.最后,应用变量替换对二次效用函数下的最优投资策略进行研究,得到了最优投资策略的显示解.  相似文献   

6.
杨鹏 《数学杂志》2014,34(4):779-786
本文研究了具有再保险和投资的随机微分博弈.应用线性-二次控制的理论,在指数效用和幂效用下,求得了最优再保险策略、最优投资策略、最优市场策略和值函数的显示解,推广了文[8]的结果.通过本文的研究,当市场出现最坏的情况时,可以指导保险公司选择恰当的再保险和投资策略使自身所获得的财富最大化.  相似文献   

7.
对带有随机效应的一般线性模型,本文提出了随机回归系数和参数线性组合的Minimax估计问题. 在二次损失下,研究了线性估计的极小极大性.关于适当的假设,得到了可估函数的唯一线性Mjnimax 估计.  相似文献   

8.
二次损失下随机回归系数和参数的线性Minimax估计   总被引:3,自引:0,他引:3  
对带有随机效应的一般线性模型,本文提出了随机回归系数和参数线性组合的Minimax估计问题.在二次损失下,研究了线性估计的极小极大性.关于适当的假设,得到了可估函数的唯一线性Minimax估计.  相似文献   

9.
本文借用线性模型系数的Minimax估计方法,在二次损失函数下运用随机优化理论对Gua.ss-Markov非线性模型的系数进行了研究,建立了非线性模型系数Minimax估计的随机优化模型.  相似文献   

10.
Markowitz的均值-方差模型在投资组合优化中得到了广泛的运用和拓展,其中多数拓展模型仅局限于对随机投资组合或模糊投资组合的研究,而忽略了实际问题同时包含了随机信息和模糊信息两个方面。本文首先定义随机模糊变量的方差用以度量投资组合的风险,提出具有阀值约束的最小方差随机模糊投资组合模型,基于随机模糊理论,将该模型转化为具有线性等式和不等式约束的凸二次规划问题。为了提高上述模型的有效性,本文以投资者期望效用最大化为压缩目标对投资组合权重进行压缩,构建等比例-最小方差混合的随机模糊投资组合模型,并求解该模型的最优解。最后,运用滚动实际数据的方法,比较上述两个模型的夏普比率以验证其有效性。  相似文献   

11.
In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems. We show that each problem is polynomially solved. Strong duality holds if a redundant constraint is introduced. As an application, a new lower bound is proposed for the quadratic assignment problem.  相似文献   

12.
研究了单输入多时滞的离散时间系统的线性二次调节问题(LQR问题),给出了求解最优控制输入序列的一种简单有效而又新颖的方法.将该动态的离散时滞系统的LQR最优控制问题最终转化成了一个静态的、不带时滞的数学规划模型——带等式线性约束的严格凸二次规划问题,并利用两种方法解这个二次规划问题,均成功地导出了系统的最优控制输入序列.仿真结果验证了我们的方法的正确有效性.  相似文献   

13.
In this paper, a new variable reduction technique is presented for general integer quadratic programming problem (GP), under which some variables of (GP) can be fixed at zero without sacrificing optimality. A sufficient condition and a necessary condition for the identification of dominated terms are provided. By comparing the given data of the problem and the upper bound of the variables, if they meet certain conditions, some variables can be fixed at zero. We report a computational study to demonstrate the efficacy of the proposed technique in solving general integer quadratic programming problems. Furthermore, we discuss separable integer quadratic programming problems in a simpler and clearer form.  相似文献   

14.
任燕  陈伟 《运筹学学报》2010,14(1):66-76
本文主要讨论了二次整数规划问题的线性化方法.在目标函数为二次函数的情况下,我们讨论了带有二次约束的整数规划问题的线性化方法,并将文献中对二次0-1问题的研究拓展为对带有盒约束的二次整数规划问题的研究.最终将带有盒约束的二次整数规划问题转化为线性混合0-1整数规划问题,然后利用Ilog-cplex或Excel软件中的规划求解工具进行求解,从而解决原二次整数规划.  相似文献   

15.
This paper investigates the general quadratic programming problem, i.e., the problem of finding the minimum of a quadratic function subject to linear constraints. In the case where, over the set of feasible points, the objective function is bounded from below, this problem can be solved by the minimization of a linear function, subject to the solution set of a linear complementarity problem, representing the Kuhn-Tucker conditions of the quadratic problem.To detect in the quadratic problem the unboundedness from below of the objective function, necessary and sufficient conditions are derived. It is shown that, when these conditions are applied, the general quadratic programming problem becomes equivalent to the investigation of an appropriately formulated linear complementarity problem.This research was supported by the Hungarian Research Foundation, Grant No. OTKA/1044.  相似文献   

16.
The uncapacitated plant location problem under uncertainty is formulated in a mean-variance framework with prices in various markets correlated via their response to a common random factor. This formulation results in a mixed-integer quadratic programming problem. However, for a given integer solution, the resulting quadratic programming problem is amenable to a very simple solution procedure. The simplicity of this algorithm means that reasonably large problems should be solvable using existing branch-and-bound techniques.  相似文献   

17.
In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here).  相似文献   

18.
张韶华 《数学杂志》2007,27(1):15-18
研究了二次剩余问题,利用整数分类的办法,给出了|Jn|和|Qn|的公式(这里n是奇合数,Jn是Zn*中有Jacobi符号为1的所有元素的集合,Qn是模n的所有二次剩余的集合) .基于这些结果,可以得出当a对模n的Jacobi符号等于1时,正确猜测a为模n的二次剩余的可能性,从而推广了[1]p .74中的结果.  相似文献   

19.
In this paper we consider optimization problems defined by a quadratic objective function and a finite number of quadratic inequality constraints. Given that the objective function is bounded over the feasible set, we present a comprehensive study of the conditions under which the optimal solution set is nonempty, thus extending the so-called Frank-Wolfe theorem. In particular, we first prove a general continuity result for the solution set defined by a system of convex quadratic inequalities. This result implies immediately that the optimal solution set of the aforementioned problem is nonempty when all the quadratic functions involved are convex. In the absence of the convexity of the objective function, we give examples showing that the optimal solution set may be empty either when there are two or more convex quadratic constraints, or when the Hessian of the objective function has two or more negative eigenvalues. In the case when there exists only one convex quadratic inequality constraint (together with other linear constraints), or when the constraint functions are all convex quadratic and the objective function is quasi-convex (thus allowing one negative eigenvalue in its Hessian matrix), we prove that the optimal solution set is nonempty.  相似文献   

20.
The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO). It is NP-hard, and contains the maximum stable set problem in graphs as a special case. In this note, we show that the SQO problem may be reformulated as an (exponentially sized) linear program (LP). This reformulation also suggests a hierarchy of polynomial-time solvable LP’s whose optimal values converge finitely to the optimal value of the SQO problem. The hierarchies of LP relaxations from the literature do not share this finite convergence property for SQO, and we review the relevant counterexamples.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号