A variant of the dual simplex method for a linear semidefinite programming problem (Q1744997)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A variant of the dual simplex method for a linear semidefinite programming problem |
scientific article |
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
