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 this page instead for the normal view: Characterizing extreme points as basic feasible solutions in infinite linear programs |
scientific article; zbMATH DE number 5509869
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
