On the use of cuts in reverse convex programs (Q913668)
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 4147873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the use of cuts in reverse convex programs |
scientific article; zbMATH DE number 4147873 |
Statements
On the use of cuts in reverse convex programs (English)
0 references
1991
0 references
A cutting method, using the idea of Tuy cuts, has been suggested in earlier papers as a possible means of solving reverse convex programs. However, the method is fraught with theoretical and numerical difficulties. Stringent sufficient conditions for convergence in n dimensions are given. However, examples of nonconvergence are given and reasons for this nonconvergence are developed. A result of the discussion is a convergent algorithm which combines the idea of the cutting plane method with vertex enumeration procedures in order to numerically improve upon the edge search procedure of \textit{R. J. Hillestad} [see Oper. Res. 23, 1091-1098 (1975; Zbl 0335.90039)].
0 references
nonconvex programming
0 references
cutting method
0 references
Tuy cuts
0 references
reverse convex programs
0 references
examples of nonconvergence
0 references
vertex enumeration
0 references
0 references
0.8441426157951355
0 references
