Characterizing extreme points as basic feasible solutions in infinite linear programs (Q1002074)
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 5509869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing extreme points as basic feasible solutions in infinite linear programs |
scientific article; zbMATH DE number 5509869 |
Statements
Characterizing extreme points as basic feasible solutions in infinite linear programs (English)
0 references
23 February 2009
0 references
strictly positive support
0 references
non-stationary Markov decision processes
0 references
infinite network flow problems
0 references
0.7838588953018188
0 references
0.7813406586647034
0 references
0.7666655778884888
0 references
0.765155017375946
0 references
0.76146000623703
0 references
