Pages that link to "Item:Q1002074"
From MaRDI portal
The following pages link to Characterizing extreme points as basic feasible solutions in infinite linear programs (Q1002074):
Displaying 11 items.
- The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems (Q678712) (← links)
- Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space (Q1785223) (← links)
- On packing and covering polyhedra in infinite dimensions (Q1785750) (← links)
- A dual scheme for solving linear countable semi-infinite fractional programming problems (Q2115313) (← links)
- Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
- Approximating extreme points of infinite-dimensional convex sets (Q2757544) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- Extreme point characterizations for infinite network flow problems (Q3418208) (← links)
- (Q3712145) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)