1 / 2

1.4 修正单纯型法

1.4 修正单纯型法. 原单纯型法迭代所需存储量大 原单纯型法有不必要的计算量 1.4.1 修正单纯型的原理. 1.4.1 修正单纯型的原理. 关键是求新基的逆矩阵 B  1 仍然可以采用四角算法 混合算法 当前基的逆矩阵 B  1 在原单纯型表的什么位置上？ 在初始可行基向量位置上 ( A N | I )  ( I | A N  1 ).

daria-mcclure
Download Presentation

1.4 修正单纯型法

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 1.4 修正单纯型法 • 原单纯型法迭代所需存储量大 • 原单纯型法有不必要的计算量 1.4.1 修正单纯型的原理

  2. 1.4.1 修正单纯型的原理 • 关键是求新基的逆矩阵 B1 • 仍然可以采用四角算法 • 混合算法 • 当前基的逆矩阵 B1在原单纯型表的什么位置上？ • 在初始可行基向量位置上 ( AN | I )  ( I | AN1 )

More Related