节点文献
关于线性规划最优对偶解的一条注记
A Note on the Optimal Dual Solution of Linear Programming
【摘要】 本文报导了线性规划最优对偶解的如下一个性质,即以最优对偶解按本文所述方式变换原问题的系数,并组成新的线性规划问题时,新的最优对偶解值全为1。本文对此现象作了经济意义上的解释。
【Abstract】 An interesting property of the optimal dual solution of LP,that was notmentioned in textbooks or research reports in the past,may be described asfollowing:Suppose a LP problem is expressed asmax C·Xs.t.A·X≤B(1)x≥0where,C=(c1,c2,…,cn),X=(x1,x2,…,xn)r,B=(b1,b2,…,bn)T,and A=(ai)m×nLet D=(d1,d2,…,dn)T be the optimal dual solution,and all components ofwhich are assumed to be nonzero.Then if the components of matrices C,B andA in(1)are replaced by:c’i=ci·1/di,b’i=bj·1/dj,a’ij=aij·di/d,(2)the components of the new optimal dual solution would all be unity,i.e.D′=(1,1,1…,1)T.This property would be useful in explaining the economic meaningof the optimal dual solution of LP in some special cases.
- 【文献出处】 系统工程 ,Systems Engineering , 编辑部邮箱 ,1990年04期
- 【被引频次】1
- 【下载频次】23