Farkas-type conditions of general interval linear systems for AE solvability
From MaRDI portal
Publication:347502
DOI10.1016/J.LAA.2016.11.006zbMATH Open1349.15005OpenAlexW2549815497MaRDI QIDQ347502FDOQ347502
Authors: Haohao Li, Mengxue Xia 
Publication date: 30 November 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.11.006
Recommendations
- Farkas-type theorems for interval linear systems
- Farkas-type theorems for general interval linear systems
- Transformations of interval linear systems of equations and inequalities
- A Farkas-type theorem for interval linear inequalities
- AE solutions and AE solvability to general interval linear systems
Cites Work
- Introduction to Interval Analysis
- Linear Optimization Problems with Inexact Data
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
- Localized solutions to interval linear equations
- A new technique in systems analysis under interval uncertainty and ambiguity
- Strong optimal solutions of interval linear programming
- Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
- Weak and strong solvability of interval linear systems of equations and inequalities
- A right-preconditioning process for the formal-algebraic approach to inner and outer estimation of AE-solution sets.
- Explicit description of \(AE\) solution sets for parametric linear systems
- Outer enclosures to the parametric \(AE\) solution set
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
- Robust optimal solutions in interval linear programming with forall-exists quantifiers
- A Farkas-type theorem for linear interval equations
- Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic
- A Farkas-type theorem for interval linear inequalities
- A short note on solvability of systems of interval linear equations
- Linear Programming with Inexact Data is NP‐Hard
- Solvability of Systems of Linear Interval Equations
- AE solutions and AE solvability to general interval linear systems
- Title not available (Why is that?)
- Farkas-type theorems for interval linear systems
- Letter to the editor
- Solvability and feasibility of interval linear equations and inequalities
Cited In (6)
- A Farkas-type theorem for linear interval equations
- Farkas-type theorems for general interval linear systems
- Farkas-type theorems for interval linear systems
- AE solutions and AE solvability to general interval linear systems
- Transformations of interval linear systems of equations and inequalities
- EA solutions and EA solvability to general interval linear systems
This page was built for publication: Farkas-type conditions of general interval linear systems for AE solvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347502)
