No label defined (Q3342220)
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 3876932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3876932 |
Statements
1984
0 references
linearly constrained minimization
0 references
compact polyhedral domain
0 references
simplex- like solution method
0 references
0.7840719223022461
0 references
0.7832338809967041
0 references
0.7747408747673035
0 references
0.770333468914032
0 references
0.7674493193626404
0 references
[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.
0 references