Pages that link to "Item:Q319852"
From MaRDI portal
The following pages link to Circumventing the Slater conundrum in countably infinite linear programs (Q319852):
Displaying 6 items.
- Robust optimization in countably infinite linear programs (Q276340) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
- An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces (Q2420790) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)
