Multiparametric analysis of the maximum tolerance in quadratic programming problems.

DOI10.1007/BF03398599MaRDI QIDQ2468627zbMATH OpenOpenAlexFDO

Authors Pankaj Gupta, Davinder Bhatia

Publication date 25 January 2008

Published in Opsearch (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 728195 (Why is no real title available?)
• Equilibrium Points of Bimatrix Games
• Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
• Multi-parametric analysis of the maximum tolerance in a linear programming problem
• Some Perturbation Theorems for Q-Matrices
• Some perturbation results for the Linear Complementarity Problem
• Stability of the linear complementarity problem at a solution point
• Tolerance approach to sensitivity analysis in linear complementarity problems

Cited in

(1)

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

This page was built for publication: Multiparametric analysis of the maximum tolerance in quadratic programming problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468627)