首页 | 本学科首页   官方微博 | 高级检索  
     检索      

战斗对策:有约束极小极大途径(I)
引用本文:G.Isac,郑权.战斗对策:有约束极小极大途径(I)[J].运筹学学报,2005,9(4):1-13.
作者姓名:G.Isac  郑权
作者单位:1. Department of Mathematics and Computer Science, Royal Military Colloge Kingston, Ontario, K7K 5L0, Canada
2. 上海大学数学系,上海,200444;Columbus,State,University,Columbus,GA,31907,USA
摘    要:本文把战斗对策归结为有约束极小极大问题,讨论解的存在性.引进不连续罚函数后,把有约束问题化为无约束极小极大问题。

关 键 词:运筹学  战斗对策  微分对策  有约束极小极大  不连续罚函数
收稿时间:2005-01-13
修稿时间:2005年1月13日

On Combat Games: A Constrained Minimaximization Approach (I)
G.Isac,Quan Zheng.On Combat Games: A Constrained Minimaximization Approach (I)[J].OR Transactions,2005,9(4):1-13.
Authors:GIsac  Quan Zheng
Institution:G. Isac, Quan Zheng( 1.Department of Mathematics and Computer Science, Royal Military Colloge Kingston, Ontario, KTK 5L0, Canada 2.Department of Mathematics, Shanghai University, Shanghai 200444,China;
Abstract:Combat games are considered with a constrained minimaximization approach in this research work. We formulate a combat game with several constrained min-max problems and convert them to unconstrained ones by utilizing a discontinuous penalty technique. Existence of min-max solutions is examined. With the integral minimization method, we will study the solution of the problem in 22].
Keywords:Operations research  combat games  differential games  constrained minimaximization  discontinuous penalty function
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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