Gröbner bases in asymptotic analysis of perturbed polynomial programs

DOI10.1007/s00186-006-0073-5zbMath1119.13024OpenAlexW1983949899MaRDI QIDQ857824

Jerzy A. Filar, Vladimir V. Ežov

Publication date: 5 January 2007

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

Full work available at URL: https://doi.org/10.1007/s00186-006-0073-5

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (2)

Hidden equations of risk critical thresholds ⋮ Multivariate polynomial perturbations of algebraic equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Advances in sensitivity analysis and parametric programming
• Asymptotic analysis of perturbed mathematical programs
• Linear programs dependent on a single parameter
• An asymptotic simplex method for singularly perturbed linear programs
• Computing global minima to polynomial optimization problems using Gröbner bases
• Linear parametric programming—A brief survey
• A Theory on Extending Algorithms for Parametric Problems
• On the Puiseux Series Expansion of the Limit Discount Equation of Stochastic Games
• Asymptotic Linear Programming

This page was built for publication: Gröbner bases in asymptotic analysis of perturbed polynomial programs