Characterizing extreme points as basic feasible solutions in infinite linear programs

Unlike in finite dimensions, a basic feasible solution characterization of extreme points does not hold in countably infinite linear programs. We develop regularity conditions under which such a characterization is possible. Applications to infinite network flow problems and non-stationary Markov decision processes are presented.