The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444)
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: The simplex method as a global optimizer: A \(C\)-programming perspective |
scientific article; zbMATH DE number 513307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The simplex method as a global optimizer: A \(C\)-programming perspective |
scientific article; zbMATH DE number 513307 |
Statements
The simplex method as a global optimizer: A \(C\)-programming perspective (English)
0 references
10 March 1994
0 references
For some composite nonlinear optimization problems \(c\)-programming techniques lead to a linear parametric problem, which could be solved by a simplex method. The paper gives a summary over such techniques for global optimization and a number of illustrative examples.
0 references
composite nonlinear optimization
0 references
\(c\)-programming
0 references
linear parametric problem
0 references
simplex method
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0.8755447
0 references
0.8735905
0 references
0.8730446
0 references
0.8721573
0 references
0.86586565
0 references
0.8649168
0 references
0.8634372
0 references
