A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:910336 |
scientific article; zbMATH DE number 4139505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A finite cutting plane method for solving linear programs with an additional reverse convex constraint |
scientific article; zbMATH DE number 4139505 |
Statements
A finite cutting plane method for solving linear programs with an additional reverse convex constraint (English)
0 references
1990
0 references
A finite cutting plane method is proposed for solving linear programs with an additional reverse convex constraint. The method is based on the property that, under mild assumptions, an optimal solution lies on at least one edge of the polyhedron determined by the linear constraints. It combines convexity cuts with disjunctive cuts and also uses at certain stages a procedure (involving solving a set covering problem) for finding an edge of the original polyhedron which contains at least a feasible point to all previously generated cuts. Some computational experience is reported.
0 references
nonconvex programming
0 references
finite cutting plane method
0 references
additional reverse convex constraint
0 references
linear constraints
0 references
convexity cuts
0 references
disjunctive cuts
0 references
set covering
0 references
computational experience
0 references
0 references
0 references
0 references
0.8747159242630005
0 references
