摘要
本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。
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.
出处
《国防科技大学学报》
EI
CAS
CSCD
北大核心
1993年第2期105-110,共6页
Journal of National University of Defense Technology
关键词
目标规划
对偶算法
线性
变量有界
goal programming
regular solution dual
simplex algorithm
