摘要
讨论系数矩阵A为全单位模矩阵 ,c、x、b为整数向量的一类线性规划问题 ,对于任给的原 对偶问题的可行解 。
A linear programming problem with coeffcient matrix A as a totally unimodular matsix and c,x,b as integer vectors was studied. When arbitrary feasible solutions to the primal and the dual problems were given, several conclusions on optimal solution were obtained.
出处
《南京工业大学学报（自然科学版）》
CAS
2002年第2期97-99,共3页
Journal of Nanjing Tech University(Natural Science Edition)
关键词
线性规划
全单位模矩阵
对偶定理
最优解
linear programming
totally unimodualr matrix
duality theorem
