| 一类可分离规划的对偶算法 |
| |
| 引用本文： | 唐恒永.一类可分离规划的对偶算法[J].辽宁大学学报(自然科学版),1989(3):6-12. |
| |
| 作者姓名： | 唐恒永 |
| |
| 作者单位： | 辽宁大学数学系 |
| |
| 摘 要： | 本文研究了一类可分离线性规划问题的对偶理论,给出了求解该类问题的一个对偶算法,该算法的特点是把大问题化小,适合并行计算。
|
| 关 键 词： | 线性规划 可分离规划 并行算法 |
A Dual Algorithm for a Sort of Separable Programming |
| |
| Tang Hengyoug.A Dual Algorithm for a Sort of Separable Programming[J].Journal of Liaoning University(Natural Sciences Edition),1989(3):6-12. |
| |
| Authors: | Tang Hengyoug |
| |
| Institution: | Tang Hengyoug Department of Mathematics,Liaoning University |
| |
| Abstract: | In this paper the duality theory of a sort of seperable nonlinear programming. has been studied. A dual algorithm was given to solve these problems. The major characteristic of the algorithm suggestecl is to change large problems into small ones, and it is suitable to parallel computation. |
| |
| Keywords: | Linear Programming Nonlinear Programming Separable Programming Dual Programming Separation Theorem Parallel algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
