| 运输问题的直接算法 |
| |
| 引用本文： | 蒋宏锋.运输问题的直接算法[J].科学技术与工程,2010,10(17). |
| |
| 作者姓名： | 蒋宏锋 |
| |
| 作者单位： | 广东商学院数学与计算科学系,广州,510320 |
| |
| 摘 要： | 基于线性规划逐维选优强多项式算法的基本理论,结合运输问题模型的特殊结构,提出了运输问题直接算法: 根据目标函数的梯度向量在可行域的低维界面上的投影,通过确定运输问题在可行域上的低维等值界面,直接得出运输问题的最优解集.
|
| 关 键 词： | 运输问题 投影矩阵 最优解集 |
| 收稿时间： | 2010/3/21 0:00:00 |
| 修稿时间： | 2010/3/30 0:00:00 |
A ALGORITHM OF DIRECT METHOD FOR TRANSPORTATION PROBLEM |
| |
| jiang hong feng.A ALGORITHM OF DIRECT METHOD FOR TRANSPORTATION PROBLEM[J].Science Technology and Engineering,2010,10(17). |
| |
| Authors: | jiang hong feng |
| |
| Abstract: | This paper applies the basic theories of Strongly Polynomial Algorithm for the Linear Programming Problem to the Transportation Problem based on its special structure. First, the gradient vector projections of the objective function are computed, then the low-dimensional equivalent plane in the feasible region of Transportation Problem is established, thus the optimal solution set of transportation problem can be found directly. |
| |
| Keywords: | Transportation Problem Optimal Solution Set Projection Matrix |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
|
