Infeasibility analysis for systems of quadratic convex inequalities

DOI10.1016/S0377-2217(97)00168-9zbMath0943.90059OpenAlexW2008309411WikidataQ126401197 ScholiaQ126401197MaRDI QIDQ1296129

Wiesława T. Obuchowska

Publication date: 11 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00168-9

zbMATH Keywords

infeasibilityquadratic constraintsimplicit equality

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (6)

Feasibility in reverse convex mixed-integer programming ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Automatic repair of convex optimization problems ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ Minimal infeasible constraint sets in convex integer programs ⋮ On infeasibility of systems of convex analytic inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
• Quadratically constrained convex quadratic programmes: Faculty feasible regions
• Some results concerning post-infeasibility analysis
• Some perturbation theory for linear programming
• Minimal representation of quadratically constrained convex feasible regions
• Analyzing infeasible nonlinear programs
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• Locating Minimal Infeasible Constraint Sets in Linear Programs

This page was built for publication: Infeasibility analysis for systems of quadratic convex inequalities