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


Vertex-searching method for linear interaction programming
Authors:Qingfei Pan  Ying Xiong  Hui Qi
Institution:PAN Qingfei1,XIONG Ying2,QI Hui31. Department of Physics,Mechanical , Electric Engineering,Sanming University,Sanming 365004,Fujian,China,2. China Soft-Resource Company,Beijing100065,3. Department of Mathematics , Computer Science
Abstract:In order to solve linear interaction programming, the vertex-searching method is proposed in this paper. First, the existence of equilibrium is analyzed for the model of linear interaction programming. Then the conclusion is obtained in which the equilibrium is in the boundary of the restriction region of linear inter-action programming. Also, a searching equilibrium solution is deduced from the conclusion.
Keywords:linear interaction programming  vertex-searching method  equilibrium solution  restriction region  
本文献已被 CNKI SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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