A surrogate cutting plane algorithm for all-integer programming (Q1086159)
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 3984976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A surrogate cutting plane algorithm for all-integer programming |
scientific article; zbMATH DE number 3984976 |
Statements
A surrogate cutting plane algorithm for all-integer programming (English)
0 references
1985
0 references
We present an all-integer cutting plane technique called the surrogate cutting plane algorithm (SCPA), for solving the all-integer (otherwise linear) programming problem. We develop and solve a smaller surrogate problem based on the solution of the LP relaxation, and thereby speed convergence to the optimal solution of the original problem. We exhibit the operation of the SCPA on three small example problems, and discuss computational results on a set of standard test problems.
0 references
all-integer cutting plane technique
0 references
surrogate cutting plane algorithm
0 references
LP relaxation
0 references
0.9228364
0 references
0.9161906
0 references
0.90103734
0 references
0.89457685
0 references
0.8906468
0 references
0.8890108
0 references
0.8881799
0 references
0 references
0.88405234
0 references
