A variant of the dual simplex method for a linear semidefinite programming problem (Q1744997)
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: A variant of the dual simplex method for a linear semidefinite programming problem |
scientific article; zbMATH DE number 6862383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variant of the dual simplex method for a linear semidefinite programming problem |
scientific article; zbMATH DE number 6862383 |
Statements
A variant of the dual simplex method for a linear semidefinite programming problem (English)
0 references
20 April 2018
0 references
linear semidefinite programming problem
0 references
dual problem
0 references
extreme points
0 references
dual simplex method
0 references
0.8682851791381836
0 references
0.846921980381012
0 references
0.8459727764129639
0 references
0.8419549465179443
0 references
