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

含优面搜索法原理
引用本文:阮国桢.含优面搜索法原理[J].湘潭大学自然科学学报,1996,18(1):1-5,21.
作者姓名:阮国桢
作者单位:湘潭大学数学系
摘    要:本文为我们的快速算法是一般原则,即让迭代总是在含优面内进行,并且每次迭代从当前含优面的基点搜索到更低维含优面上的基点,如此只须至多n步迭代可收敛到一个极点最优解。文中讨论了含优面的基本性质。

关 键 词:线性规划  单纯形表  基点  含优面  搜索法

A CO - OPTIMAL FACE APPROACH FOR SOLVING LINEAR PROGRAMS
Ruan Guozhen.A CO - OPTIMAL FACE APPROACH FOR SOLVING LINEAR PROGRAMS[J].Natural Science Journal of Xiangtan University,1996,18(1):1-5,21.
Authors:Ruan Guozhen
Abstract:Let x*be the optimal solution for the linear programming problem (LP),P be a constrain face,if x* e P,then P is called the co-optimal face. In this paper,we discuss general propertis of the co-optimal face, special ideas on a co-optimal face approach, in-troduct traveling co-optimal face and a special tableaul that the simplex tableau with travel-ing co-optimal face that is called R tableau simply. Our ideas search the basic point from the co-optimal face to a intersection with another co--optimal face,and so takes n steps at most to a optimal extreme point.
Keywords:linear programming  basic solution  co-optimal face  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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