scientific article; zbMATH DE number 4135726
[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.
- A finite algorithm for concave minimization over a polyhedron
- Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
- scientific article; zbMATH DE number 4187464
- Normal conical algorithm for concave minimization over polytopes
- Concave minimization via conical partitions and polyhedral outer approximation
- Nonconvex optimization over a polytope using generalized capacity improvement
- A note on a paper by E. Khorram and A. Ghodousian
- scientific article; zbMATH DE number 3918105 (Why is no real title available?)
- Algorithms for construction of efficient frontier for nonconvex models on the basis of optimization methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468893)