Techniques of linear programming based on the theory of convex cones (Q4733657)
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: Techniques of linear programming based on the theory of convex cones |
scientific article; zbMATH DE number 4119922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Techniques of linear programming based on the theory of convex cones |
scientific article; zbMATH DE number 4119922 |
Statements
Techniques of linear programming based on the theory of convex cones (English)
0 references
1989
0 references
polyhedral cones
0 references
extreme rays
0 references
dimension reduction
0 references
convex cones approach
0 references
strictly tangent relaxation
0 references
parallel implementations
0 references
0 references
0.93833745
0 references
0.9146502
0 references
0.9146502
0 references
0 references
0.90808356
0 references
