Tolerance approach to sensitivity analysis in quadratic programming problems.

DOI10.1007/BF03398557zbMath1141.90495OpenAlexW2773000308MaRDI QIDQ2468595

Davinder Bhatia, Pankaj Gupta, R. N. Kaul

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398557

Mathematics Subject Classification ID

Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Related Items (1)

Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis.

Cites Work

• Unnamed Item
• Tolerance approach to sensitivity analysis in linear complementarity problems
• Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
• The Tolerance Approach to Sensitivity Analysis in Linear Programming
• Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
• Some perturbation results for the Linear Complementarity Problem
• Some Perturbation Theorems for Q-Matrices
• Stability of the linear complementarity problem at a solution point
• Equilibrium Points of Bimatrix Games

This page was built for publication: Tolerance approach to sensitivity analysis in quadratic programming problems.