首页 | 官方网站   微博 | 高级检索  
     

线性目标规划的解结构分析及遍历算法设计
引用本文:李禹生.线性目标规划的解结构分析及遍历算法设计[J].武汉工业学院学报,1994(3).
作者姓名:李禹生
摘    要:从一实例分析出发,推导出一般线性目标规划数学模型的多重解结构为一无向图。进而介绍了广度优先搜索多重解图的遍历算法,并为求得各个多重解设计了一种便于实施的计算机数据结构与算法。

关 键 词:线性目标规划,多重解结构,遍历算法

THE ANALYSIS OF THE SOLUTION STRUCTURE AND THE DESIGN OF THE TRAVERSE ALGORITHM FOR LINEAR GOAL PROGRAMMING
Li Yusheng.THE ANALYSIS OF THE SOLUTION STRUCTURE AND THE DESIGN OF THE TRAVERSE ALGORITHM FOR LINEAR GOAL PROGRAMMING[J].Journal of Wuhan Polytechnic University,1994(3).
Authors:Li Yusheng
Affiliation:Food Machinery Department
Abstract:From the analysis of a practical example, the article derives that the poly-solution structure of the maths model of the general linear goal programming is an undirected graph. Furthermore, it introduces the traverse algorithm of the poly-solution graph of breadth-first search. And then it designs the date structure and the algorithm of a computer convient to be applied for finding various poly solution.
Keywords:linear goal programming  poly-solution structure  search algorithm
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号