用对偶单纯形法求对偶问题的最优解.docxVIP

  • 11
  • 0
  • 约7.18千字
  • 约 8页
  • 2023-08-01 发布于辽宁
  • 举报

用对偶单纯形法求对偶问题的最优解.docx

用对偶单纯形法求对偶问题的最优解 摘要:在线性规划的应用中,人们发现一个线性规划问题往往伴随着与之配对的另一个线性 规划问题.将其中一个称为原问题,另一个称为对偶问题.对偶理论深刻揭示了原问题与对偶 问题的内在联系.由对偶问题引申出来的对偶解有着重要的经济意义.本文主要介绍了对偶问 题的基本形式以及用对偶单纯形法求解对偶问题的最优解. 关键词:线性规划;对偶问题;对偶单纯形 Using Dual Simplex Method To Get The Optimal Solution Of The Dual Problem Abstract: In the application of the linear programming, people find that a linear programming problem is often accompanied by another paired linear programming problem. One is called original problem. Another is called the dual problem. Duality theory reveals the internal relations between the dual problem and the original problem. The

文档评论(0)

1亿VIP精品文档

相关文档