| 运输问题的逐块选优解法 |
| |
| 引用本文： | 蒋宏锋.运输问题的逐块选优解法[J].科学技术与工程,2006,6(8):922-925930. |
| |
| 作者姓名： | 蒋宏锋 |
| |
| 作者单位： | 广东商学院数学与计算科学系,广州,510320 |
| |
| 摘 要： | 在简单线性规划问题分块选优算法的基础上，结合运输问题的特性，提出了吾输问题的分块选优算法：根据目标函数梯度在可行域的低维约束平面上投影，确定它在可行域内的等值面，得出运输问题的最优解集。
|
| 关 键 词： | 运输问题 逐块选优 最优解集 |
| 文章编号： | 1671-1815(2006)08-0922-05 |
| 收稿时间： | 2005-12-29 |
| 修稿时间： | 2005年12月29 |
A Blockwise Optimization Method for Transportation Problem |
| |
| JIANG Hongfeng.A Blockwise Optimization Method for Transportation Problem[J].Science Technology and Engineering,2006,6(8):922-925930. |
| |
| Authors: | JIANG Hongfeng |
| |
| Abstract: | The algorithm of block successive optimistic for the simple linear programming to the transportation problem is applied. Based on special structure, block by block optimistic algorithm is given. First, the gradient vector projections of the objective function are computed, then the low-dimensional equivalent plane in the feasible region of the transportation problem is established, thus the optimal solution set of its can be found directly. |
| |
| Keywords: | transportation problem blockwise optimization optimum solutions |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
