Asymptotic Linear Programming
From MaRDI portal
Publication:4770202
DOI10.1287/opre.21.5.1128zbMath0283.90030OpenAlexW2135414851MaRDI QIDQ4770202
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.5.1128
Related Items (14)
An efficient basis update for asymptotic linear programming ⋮ Direct algorithms for checking consistency and making inferences from conditional probability assessments ⋮ Tropicalizing the Simplex Algorithm ⋮ Gröbner bases in asymptotic analysis of perturbed polynomial programs ⋮ Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem ⋮ A generalized inverse method for asymptotic linear programming ⋮ Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information ⋮ Policy improvement for perfect information additive reward and additive transition stochastic games with discounted and average payoffs ⋮ What Tropical Geometry Tells Us about the Complexity of Linear Programming ⋮ The asymptotic optimal partition and extensions of the nonsubstitution theorem ⋮ Singularly perturbed linear programs and Markov decision processes ⋮ Linear programs dependent on a single parameter ⋮ Sensitivity analysis in discounted Markovian decision problems ⋮ An asymptotic simplex method for singularly perturbed linear programs
This page was built for publication: Asymptotic Linear Programming
