Pages that link to "Item:Q3990571"
From MaRDI portal
The following pages link to A tie-breaking rule for discrete infinite horizon optimization (Q3990571):
Displaying 10 items.
- Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem (Q524908) (← links)
- Denumerable state nonhomogeneous Markov decision processes (Q805501) (← links)
- Convergence of selections with applications in optimization (Q805503) (← links)
- Convergence of best approximations from unbounded sets (Q1191775) (← links)
- Finite dimensional approximation in infinite dimensional mathematical programming (Q1196721) (← links)
- Solvability in infinite horizon optimization (Q1785414) (← links)
- Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls (Q1886804) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- Conditions for the discovery of solution horizons (Q2368078) (← links)
- Minimum spanning trees in infinite graphs: theory and algorithms (Q6622744) (← links)