Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719)
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 6223465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementing the simplex method as a cutting-plane method, with a view to regularization |
scientific article; zbMATH DE number 6223465 |
Statements
Implementing the simplex method as a cutting-plane method, with a view to regularization (English)
0 references
7 November 2013
0 references
simplex method
0 references
cutting-plane method
0 references
linear programming
0 references
convex programming
0 references
stochastic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8872922658920288
0 references
0.7307393550872803
0 references
0.724205493927002
0 references
0.7241365313529968
0 references
