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

线性相依条件下未确知机会约束规划的解法
引用本文:李小青,周长银,王延朝.线性相依条件下未确知机会约束规划的解法[J].唐山学院学报,2010,23(6):10-12.
作者姓名:李小青  周长银  王延朝
作者单位:山东科技大学信息科学与工程学院,山东青岛,266510
基金项目:国家自然科学基金项目(10971122); 山东省自然科学基金项目(Y2008A01)
摘    要:在未确知数为线性相依条件下,研究了一般线性约束形式的未确知机会约束规划问题的解法,并给出具体算例说明了该方法的可行性。同时,这种处理问题的思想对建立未确知支持向量机也有很大的现实意义。

关 键 词:未确知有理数  线性相依  可信度  机会约束规划

The Method of Unascertained Chance Constrained Programming under the Conditions of Linear Interdependence
LI Xiao-qing,ZHOU Chang-yin,WANG Yan-zhao.The Method of Unascertained Chance Constrained Programming under the Conditions of Linear Interdependence[J].Journal of Tangshan College,2010,23(6):10-12.
Authors:LI Xiao-qing  ZHOU Chang-yin  WANG Yan-zhao
Institution:(College of Information Science and Engineering,SUST,Qingdao 266510,China)
Abstract:Under the linear interdependence condition,the solution is studied about unascertained chance constrained programming with general linear constrain and method for solving the problem is proposed with numerical examples to demonstrate the method's feasibility.Such a way to deal with problems has great practical significance for the establishment of unascertained support vector machines.
Keywords:unascertained rational number  linear interdependence  credible degree  chance constrained programming
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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