On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872)
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:1102872 |
scientific article; zbMATH DE number 4051371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding new vertices and redundant constraints in cutting plane algorithms for global optimization |
scientific article; zbMATH DE number 4051371 |
Statements
On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (English)
0 references
1988
0 references
It is known that a number of multiextremal (global) optimization problems can be efficiently solved by cutting plane methods. Here, a new procedure is presented for finding all new vertices of the sequentially generated polytopes. Then it is shown how redundant constraints can be eliminated, knowing the vertex set of a polytope.
0 references
multiextremal optimization
0 references
cutting plane methods
0 references
all new vertices
0 references
sequentially generated polytopes
0 references
redundant constraints
0 references
0 references
0.7589470148086548
0 references
0.7478182911872864
0 references
