Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802)
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: Artificial-free simplex algorithm based on the non-acute constraint relaxation |
scientific article; zbMATH DE number 6369160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Artificial-free simplex algorithm based on the non-acute constraint relaxation |
scientific article; zbMATH DE number 6369160 |
Statements
Artificial-free simplex algorithm based on the non-acute constraint relaxation (English)
0 references
13 November 2014
0 references
artificial-free
0 references
gradient vector
0 references
linear programming
0 references
non-acute constraint relaxation
0 references
0.7648968696594238
0 references
0.7411288022994995
0 references
0.7186318039894104
0 references
0.7182446122169495
0 references
