scientific article; zbMATH DE number 3876932

From MaRDI portal
Publication:3342220





[For the entire collection see Zbl 0536.00020.] Consider the problem: (1) minimize \(\{\) f(x)\(| x\in P\}\), where P is a nonempty compact polyhedral set of \({\mathbb{R}}^ n\) and \(f:{\mathbb{R}}^ n\to {\mathbb{R}}^ 1\) a continuously differentiable function. For solving (1), the author presents a simplex-like method M. Indeed, in case of f being linear, M becomes the simplex method. If \(f(x)=\| x\|^ 2\) it behaves much the same as the algorithm by Bazaraa, Goode, and Rardin; while for a general function it is strictly related to the convex simplex method by Zangwill. The case of degeneracy on the vertices is also considered.











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 Q3342220)