An asymptotic simplex method for singularly perturbed linear programs
type: Item
instance of: scholarly article
title: An asymptotic simplex method for singularly perturbed linear programs
zbMATH Open document ID: 1010.90045
DOI: 10.1016/S0167-6377(02)00152-9
author: Jerzy Filar
author: Eitan Altman
author: Konstantin Avrachenkov
published in: Operations Research Letters
publication date: 2003-04-02T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C49
zbMATH DE Number: 1891058
zbMATH Keywords: asymptotic simplex method
zbMATH Keywords: singular perturbations
zbMATH Keywords: Laurent series
MaRDI profile type: Publication
cites work: Asymptotic linear programming and policy improvement for singularly perturbed Markov decision processes
cites work: Q3844775
cites work: A Theory on Extending Algorithms for Parametric Problems
cites work: Perturbation theory for mathematical programming problems
cites work: Linear parametric programming—A brief survey
cites work: Advances in sensitivity analysis and parametric programming
cites work: Sensitivity analysis in discounted Markovian decision problems
cites work: Input retrieval in finite dimensional linear systems
cites work: A canonical form for pencils of matrices with applications to asymptotic linear programs
cites work: Asymptotic Linear Programming
cites work: Linear programs dependent on a single parameter
cites work: Q5526485
cites work: Q4197802
cites work: A generalized inverse method for asymptotic linear programming
cites work: An efficient basis update for asymptotic linear programming
cites work: The Laurent expansion for a nearly singular matrix
cites work: An approach to nonlinear programming
cites work: Q4129685
cites work: Q4040350
cites work: The Laurent expansion of pencils that are singular at the origin
cites work: Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
description: scientific article; zbMATH DE number 1891058