Dual Simplex, Cutting-Plane
Dual Simplex, Cutting-Plane
Dual Simplex, Cutting-Plane
SHOW LESS
- No tags were found...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
ILP: <strong>Cutting</strong>-<strong>Plane</strong> Algorithm• Start at the continous optimum LP solution• Add special constraint (called cuts) to rendersan integer optimum extreme point• The cuts do not eliminate any original feasibleinteger points• The cuts must through at least one feasible orinfeasible integer point• Number of cuts is independent of the size ofthe problem
Change language