首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 93 毫秒
1.
本文研究了带Poisson 跳跃的正倒向随机延迟系统的递归最优控制问题. 利用经典的针状变分方法、对偶技术和带Poisson 跳跃的超前倒向随机微分方程的相关结果, 证明了最优控制的最大值原理, 包括了最优控制满足的必要条件和充分条件.  相似文献   

2.
在连续时间模型假设下,研究风险资产价格服从一个带有随机波动的几何布朗运动的最优消费和投资问题.首先建立了最优消费和投资同题随机最优控制数学模型;然后运用随机最优控制理论,得到了最优投资和消费随机最优控制问题的值函数所满足的线性抛物线偏微分方程和非线性抛物线偏微分方程.  相似文献   

3.
一类具年龄结构种群动力系统的最优控制   总被引:1,自引:0,他引:1  
研究一类具年龄结构种群线性动力系统的最优控制问题 .由Mazur’s定理 ,我们证明了最优控制问题 (OH)最优解的存在性 ,同时借助于法锥概念 ,我们还得到了最优控制问题 (OH)最优解存在的必要条件  相似文献   

4.
本文讨论基于单能静态稆向同性迁移方程的原子核反应堆系统的最优控制问题。本文把散射裂变截面函数当作控制变量,在一定条件下,证得最优控制的存在唯一性。本文最后给出最优散射裂变截控制存在的一个必要条件。  相似文献   

5.
本文研究了一类分数阶抛物方程的最优控制问题,主要讨论了其最优控制与最优值的稳定性.利用了凸方法获得了获得了这类问题最优控制的稳定性结果,并且推广了在参考文献[3]中的最优控制稳定性结论.  相似文献   

6.
本文研究具有终端约束的最优控制问题.利用构造罚函数的方法将其转化为无约束的近似问题,从而证明最优控制的存在性及其所满足的最大值原理.  相似文献   

7.
研究了带有中性技术进步生产函数边界条件的非线性经济增长模型的最优控制问题.利用Banach空间不动点原理,得到了系统解的存在唯一性,利用Gronwall不等式得到了系统解关于控制序列的连续依赖性,借助于法锥和共轭系统,得到了控制问题最优解存在的必要条件.  相似文献   

8.
首先讨论了一类线性随机脉冲控制系统的精确能控性质,给出了该类控制系统的脉冲精确能控的等价的代数判据.然后提出了一个确定性的二维线性脉冲控制系统的时间-脉冲强度最优控制问题;利用动态规划原理,给出了脉冲最优控制的反馈形式和值函数的显式表达式;说明了值函数在整个平面上是连续的,在左右两个半平面的内部还是连续可微的.  相似文献   

9.
研究某一类改进的关于年龄结构的非线性种群系统的最优控制问题.首先利用常用的极小化序列方法证明最优控制问题的最优解存在;其次定义原系统对应的共轭系统,借助于法锥定义,得到最优解所要满足的必要条件.  相似文献   

10.
魏灿 《数学杂志》2022,(2):169-179
本文研究了金融市场的风险传染问题.在推广了已有的传染病模型之后,利用最优控制理论推导出潜伏状态下金融子市场的最优治愈率,以及隔离状态下监管部门的最优隔离率的表达式.通过数值模拟获得了在不同情形下最优控制策略的变化,影响风险传染因素的结果.  相似文献   

11.
In this paper, we use the solutions of forward-backward stochastic differential equations to get the optimal control for backward stochastic linear quadratic optimal control problem. And we also give the linear feedback regulator for the optimal control problem by using the solutions of a group of Riccati equations.  相似文献   

12.
跳扩散模型下基金平衡管理的最优脉冲控制   总被引:1,自引:0,他引:1       下载免费PDF全文
在基金市值波动服从跳扩散过程, 基金持有的罚金成本为当前基金水平的二次函数及存在交易费的假设下研究了无穷时域的基金平衡管理的最小成本模型. 利用随机最优脉冲控制的拟变分不等式理论建立了判定定理,得到了最优脉冲控制策略的存在性, 同时通过构造方法给出了解的数学结构形式.  相似文献   

13.
作者研究了一个条件平均场随机微分方程的最优控制问题.这种方程和某些部分信息下的随机最优控制问题有关,并且可以看做是平均场随机微分方程的推广.作者以庞特里雅金最大值原理的形式给出最优控制满足的必要和充分条件.此外,文中给出一个线性二次最优控制问题来说明理论结果的应用.  相似文献   

14.
现代金融经济中的很多问题可以构建成随机控制模型,而随机控制的求解却存在一定的困难.马氏链算法应该是一种有效的求解随机控制问题的数值方法.本文以Claus Munk的工作为基础,针对一类最优投资模型,具体确定了马氏链的转移矩阵并证明其满足算法收敛条件,并用MATLAB语言编成一个程序实现.  相似文献   

15.
We address the optimal control problem of a very general stochastic hybrid system with both autonomous and impulsive jumps. The planning horizon is infinite and we use the discounted-cost criterion for performance evaluation. Under certain assumptions, we show the existence of an optimal control. We then derive the quasivariational inequalities satisfied by the value function and establish well-posedness. Finally, we prove the usual verification theorem of dynamic programming.  相似文献   

16.
In this work,we study the gradient projection method for solving a class of stochastic control problems by using a mesh free approximation ap-proach to implement spatial dimension approximation.Our main contribu-tion is to extend the existing gradient projection method to moderate high-dimensional space.The moving least square method and the general radial basis function interpolation method are introduced as showcase methods to demonstrate our computational framework,and rigorous numerical analysis is provided to prove the convergence of our meshfree approximation approach.We also present several numerical experiments to validate the theoretical re-sults of our approach and demonstrate the performance meshfree approxima-tion in solving stochastic optimal control problems.  相似文献   

17.
Using the decomposition of solution of SDE, we consider the stochastic optimal control problem with anticipative controls as a family of deterministic control problems parametrized by the paths of the driving Wiener process and of a newly introduced Lagrange multiplier stochastic process (nonanticipativity equality constraint). It is shown that the value function of these problems is the unique global solution of a robust equation (random partial differential equation) associated to a linear backward Hamilton-Jacobi-Bellman stochastic partial differential equation (HJB SPDE). This appears as limiting SPDE for a sequence of random HJB PDE's when linear interpolation approximation of the Wiener process is used. Our approach extends the Wong-Zakai type results [20] from SDE to the stochastic dynamic programming equation by showing how this arises as average of the limit of a sequence of deterministic dynamic programming equations. The stochastic characteristics method of Kunita [13] is used to represent the value function. By choosing the Lagrange multiplier equal to its nonanticipative constraint value the usual stochastic (nonanticipative) optimal control and optimal cost are recovered. This suggests a method for solving the anticipative control problems by almost sure deterministic optimal control. We obtain a PDE for the “cost of perfect information” the difference between the cost function of the nonanticipative control problem and the cost of the anticipative problem which satisfies a nonlinear backward HJB SPDE. Poisson bracket conditions are found ensuring this has a global solution. The cost of perfect information is shown to be zero when a Lagrangian submanifold is invariant for the stochastic characteristics. The LQG problem and a nonlinear anticipative control problem are considered as examples in this framework  相似文献   

18.
We consider the problem of determining an optimal driving strategy in a train control problem with a generalised equation of motion. We assume that the journey must be completed within a given time and seek a strategy that minimises fuel consumption. On the one hand we consider the case where continuous control can be used and on the other hand we consider the case where only discrete control is available. We pay particular attention to a unified development of the two cases. For the continuous control problem we use the Pontryagin principle to find necessary conditions on an optimal strategy and show that these conditions yield key equations that determine the optimal switching points. In the discrete control problem, which is the typical situation with diesel-electric locomotives, we show that for each fixed control sequence the cost of fuel can be minimised by finding the optimal switching times. The corresponding strategies are called strategies of optimal type and in this case we use the Kuhn–Tucker equations to find key equations that determine the optimal switching times. We note that the strategies of optimal type can be used to approximate as closely as we please the optimal strategy obtained using continuous control and we present two new derivations of the key equations. We illustrate our general remarks by reference to a typical train control problem.  相似文献   

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

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