| 变量有界线性目标规划的对偶算法 |
| |
| 引用本文： | 徐培德.变量有界线性目标规划的对偶算法[J].国防科技大学学报,1993,15(2):105-110. |
| |
| 作者姓名： | 徐培德 |
| |
| 作者单位： | 国防科技大学系统工程与应用数学系 |
| |
| 摘 要： | 本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。
|
| 关 键 词： | 目标规划 正则解 对偶算法 |
| 收稿时间： | 1991/12/24 0:00:00 |
A Dual Simplex Algorithm for Solving Linear Goal programming with Bounded Variables |
| |
| Xu Peide.A Dual Simplex Algorithm for Solving Linear Goal programming with Bounded Variables[J].Journal of National University of Defense Technology,1993,15(2):105-110. |
| |
| Authors: | Xu Peide |
| |
| Institution: | Department of System Engineering and Applied Mathematics |
| |
| Abstract: | This paper discussed the problem of linear goal programming with bounded vari-ables and gave a dual simplex algorithm for soluing this kind of problem. The algorithmis analogous to the dual simplex algorithm for linear programming with bounded vari-ables. The efficiency of the algorithm is proved and an example is given to show theproccedure of the algorithm. |
| |
| Keywords: | goal programming regular solution dual simplex algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
