| 引用本文: | 徐培德.变量有界线性目标规划的对偶算法.[J].国防科技大学学报,1993,15(2):105-110.[点击复制] |
| 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[点击复制] |
|
| |
|
|
| 本文已被：浏览 5903次 下载 5585次 |
| 变量有界线性目标规划的对偶算法 |
| 徐培德 |
|
(系统工程与应用数学系)
|
| 摘要: |
| 本文讨论了变量有界的线性目标规划问题，给出了求解这类问题的一个对偶算法，此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性，并举例说明了计算过程。 |
| 关键词: 目标规划，正则解，对偶算法 |
| DOI： |
| 投稿日期：1991-12-24 |
| 基金项目: |
|
| A Dual Simplex Algorithm for Solving Linear Goal programming with Bounded Variables |
| Xu Peide |
|
(Department of System Engineering and Applied Mathematics)
|
| Abstract: |
| This paper discussed the problem of linear goal programming with bounded variables and gave a dual simplex algorithm for soluing this kind of problem. The algorithm is analogous to the dual simplex algorithm for linear programming with bounded variables. The efficiency of the algorithm is proved and an example is given to show the proccedure of the algorithm. |
| Keywords: goal programming,regular solution dual,simplex algorithm |
|
|
