Localized solutions to interval linear equations
Given an \(m\times n\) interval matrix \({\mathbf A}=[\underline A,\overline A]\) and an interval vector \({\mathbf b}= [\underline b,\overline b]\) with \(m\) components, the authors consider the following particular solution sets: the \(L\)-localized solution set \(\Sigma_{LS}({\mathbf A},{\mathbf b})= \{x\in\mathbb{R}^n\mid{\mathbf A}\cdot x\leq_{st}{\mathbf b}\}\), the \(R\)-localized solution set \(\Sigma_{RS}({\mathbf A},{\mathbf b})= \{x\in\mathbb{R}^n\mid(-{\mathbf A}\cdot x)\leq_{st}(-{\mathbf b})\}\), and the localized solution set \(\Sigma_{ST}({\mathbf A},{\mathbf b})= \{x\in\mathbb{R}^n|\) for every J\(i\in\{1,\dots, m\}\) either \(({\mathbf A}\cdot x)_i\leq_{st}{\mathbf b}_i\) or \((-{\mathbf A}\cdot x)_i\leq_{st}(-{\mathbf b})_i\) holds\}, where the product \({\mathbf A}\cdot x\) is the usual one in interval analysis. The relation \({\mathbf a}\leq_{st}{\mathbf c}\) between two nonempty compact intervals \({\mathbf a}= [\underline a,\overline a]\), \({\mathbf c}= [\underline c,\overline c]\) is defined by \(\underline a\leq\underline c\leq\overline a\leq\overline c\); for vectors this relation has to hold componentwise. The authors illustrate and motivate these solution sets by examples. They prove two necessary and sufficient criteria for \(x\in\mathbb{R}^n\) to belong to \(\Sigma_{LS}({\mathbf A},{\mathbf b})\), to \(\Sigma_{RS}({\mathbf A},{\mathbf b})\), and to \(\Sigma_{ST}({\mathbf A},{\mathbf b})\), respectively, and they also state and prove a necessary one.
- \(L\)- and \(R\)-localized solvabilities of max-separable interval linear equations and its applications
- New characterizations of tolerance-control and localized solutions to interval system of linear equations
- Tolerance-localized and control-localized solutions of interval linear equations system and their application to course assignment problem
- Interval solutions of linear interval equations
- Solution sets for systems of linear interval equations
- Sign-stable solutions of column-vague linear equation systems
- Some properties of the lower bound of optimal values in interval convex quadratic programming
- Tolerance-localized and control-localized solutions of interval linear equations system and their application to course assignment problem
- Solution types of two-sided interval linear system and their application on interval linear programming problems
- An algorithm for solving two-sided interval system of max-plus linear equations
- New characterizations of tolerance-control and localized solutions to interval system of linear equations
- Checking weak optimality of the solution to linear programming with interval right-hand side
- Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
- Some results on the upper bound of optimal values in interval convex quadratic programming
- Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
- Farkas-type conditions of general interval linear systems for AE solvability
- \(L\)- and \(R\)-localized solvabilities of max-separable interval linear equations and its applications
- Farkas-type theorems for interval linear systems
- Closed form of \(L\)-localized solution set of MAX-plus interval linear system and its application on optimization problem
- EA solutions and EA solvability to general interval linear systems
- Transformations of mixed solution types of interval linear equations system with boundaries on its left-hand side to linear inequalities with binary variables
- Transformations of solution semantics of interval linear equations system
- Solvability and feasibility of interval linear equations and inequalities
This page was built for publication: Localized solutions to interval linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758400)
