A Theory on Extending Algorithms for Parametric Problems

DOI10.1287/moor.14.3.502zbMath0673.90081OpenAlexW2104445255MaRDI QIDQ3827805

Uriel G. Rothblum, B. Curtis Eaves

Publication date: 1989

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.14.3.502

zbMATH Keywords

ordered fieldparametric problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Algorithms in computer science (68W99)

Related Items (10)

Formulation of linear problems and solution by a universal machine ⋮ Perron-Frobenius theory over real closed fields and fractional power series expansions ⋮ Computing uniformly optimal strategies in two-player stochastic games ⋮ An algorithm for computing maximum solution bases ⋮ Generating approximate parametric roots of parametric polynomials ⋮ Gröbner bases in asymptotic analysis of perturbed polynomial programs ⋮ Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields ⋮ Nonnegative ranks, decompositions, and factorizations of nonnegative matrices ⋮ An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms ⋮ An asymptotic simplex method for singularly perturbed linear programs

This page was built for publication: A Theory on Extending Algorithms for Parametric Problems