A disjunctive cutting plane procedure for general mixed-integer linear programs (Q5930736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1590576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A disjunctive cutting plane procedure for general mixed-integer linear programs |
scientific article; zbMATH DE number 1590576 |
Statements
A disjunctive cutting plane procedure for general mixed-integer linear programs (English)
0 references
3 October 2001
0 references
A cutting plane algorithm for mixed integer programs with general integer variables is developed. It is based on variable disjunctions. The authors prove that the procedure finitely generates the convex hull for any variable \(x_j \in \mathbb Z\) and conv\((F)\) in the limit. The cutting plane algorithm generates cutting planes at the optimal and near optimal vertices. The work extends earlier research on integer programmes with binary variables.
0 references
mixed integer programming
0 references
branch and cut
0 references
variable disjunction
0 references
0.8659532070159912
0 references
0.824549674987793
0 references
0.8183616995811462
0 references
0.8148403763771057
0 references
