Integer linear optimization: Cutting Planes 2: Unterschied zwischen den Versionen
Aus Operations-Research-Wiki
| [unmarkierte Version] | [unmarkierte Version] |
(→Idea) |
(→Idea) |
||
| Zeile 4: | Zeile 4: | ||
== Idea == | == Idea == | ||
The Idea of the Cutting Plane is to add Restrictions (the Cutting Planes) to contract the solution space more and more to get integers. These restrictions cut of the non-integer parts of the solution. | The Idea of the Cutting Plane is to add Restrictions (the Cutting Planes) to contract the solution space more and more to get integers. These restrictions cut of the non-integer parts of the solution. | ||
| + | |||
| + | |||
| + | == Approach == | ||
| + | First of all you should divide your restrictions trough the greates common factor. | ||
| + | Example: 6x1 – 15x2 <= 120 | ||
| + | --> 3 x1 – 5 x2 <= 40 | ||
Version vom 20. Juni 2013, 11:48 Uhr
Cutting Planes Gruppe 2
Idea
The Idea of the Cutting Plane is to add Restrictions (the Cutting Planes) to contract the solution space more and more to get integers. These restrictions cut of the non-integer parts of the solution.
Approach
First of all you should divide your restrictions trough the greates common factor. Example: 6x1 – 15x2 <= 120 --> 3 x1 – 5 x2 <= 40
