Positively regular vague matrices
From MaRDI portal
Recommendations
Cites work
- Checking robust nonsingularity is NP-hard
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Connections between generalized, inexact and semi-infinite linear programming
- scientific article; zbMATH DE number 4109935 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- Inaccurate linear equation system with a restricted-rank error matrix
- On nonconvexity of the solution set of a system of linear interval equations
- On the Solution Set of a Linear System with Inaccurate Coefficients
- Optimale Lösung von Intervallgleichungssystemen
- Sign-stable solutions of column-vague linear equation systems
- Systems of linear interval equations
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
- Vague matrices in linear programming
Cited in
(2)
This page was built for publication: Positively regular vague matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932203)