No label defined (Q3468893)
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 4135726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4135726 |
Statements
1989
0 references
nonconvex optimization
0 references
concave minimization
0 references
polytope
0 references
0.8242959380149841
0 references
0.8137083053588867
0 references
0.808357298374176
0 references
0.8073628544807434
0 references
[For the entire collection see Zbl 0678.00013.] This author and several others have developed a number of algorithms for solving the concave minimization problem [see for example the author, \textit{Bui The Tam} and \textit{Vu Thien Ban} [Acta Math. Vietnam. 8, No.1, 21-40 (1983; Zbl 0562.90069)]. The efficiency of some of those methods ``crucially depends upon the concrete procedures for determining the vertices of a polytope which is obtained by adding a new linear constraint to a given polytope with known vertices''. The main purpose of this paper is to present a solution method for such subproblems. An additional result is the equivalence of the linear complementarity problem and that of concave minimization over polytopes. Results of some numerical examples and experimentations with the proposed algorithm are also reported.
0 references