Baseline of the simplex method
• Conceived by Prof. George B. Dantzig in 1947.
• Basic idea
Phase I:
Step 1:(Starting)
Find an initial extreme point (ep) or declare P is null
----> Find an initial basic feasible solution ( bfs), or declare P is null.
Phase II:
Step 2:(checking optimality)
If the current ep. is optimal. STOP!
---->check reduced cost along every nbv, 如果都>=0,则该点optimal
如果一个以上的reduced cost=0,则有multiple optimal solution
reduced cost<0、d_q每个元素都>=0,unbounded below
Step 3:(pivoting)
Move to a better ep.
Return to Step 2.
iteration迭代
没有退化nondegenerate
问题:ep可能不是和bfs一一对应,可能会在一个顶点打转,
bfs=0时,就会和非bfs搞混,
fundamental matrix