A simple finite cone covering algorithm for concave minimization (Q5930000)
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: A simple finite cone covering algorithm for concave minimization |
scientific article; zbMATH DE number 1587232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple finite cone covering algorithm for concave minimization |
scientific article; zbMATH DE number 1587232 |
Statements
A simple finite cone covering algorithm for concave minimization (English)
0 references
16 December 2001
0 references
One of the classical solution methods for concave minimization problems over a polytope is the cone covering algorithm by Tuy. This paper proposes a new simple covering scheme using cones with \(n\) extreme rays and requiring only two linear programs per cone. Especially, easy conditions to detect cycling are given. Also the finiteness and correctness of the presented algorithm ist proved.
0 references
concave minimization
0 references
cone covering algorithm
0 references
0.8417389988899231
0 references
0.8289566040039062
0 references
0.8236383199691772
0 references
