Weak and strong solvability of interval linear systems of equations and inequalities
From MaRDI portal
Publication:389688
DOI10.1016/j.laa.2013.02.012zbMath1305.65139OpenAlexW2045297403MaRDI QIDQ389688
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2013.02.012
Related Items
Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients, Some results on the upper bound of optimal values in interval convex quadratic programming, Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes, Radii of solvability and unsolvability of linear systems, Robust optimal solutions in interval linear programming with forall-exists quantifiers, Farkas-type conditions of general interval linear systems for AE solvability, Some properties of the lower bound of optimal values in interval convex quadratic programming, On strong optimality of interval linear programming, The outcome range problem in interval linear programming, Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions, New characterizations of tolerance-control and localized solutions to interval system of linear equations, 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 interval linear systems of equations and inequalities, Various approaches to multiobjective linear programming problems with interval costs and interval weights, Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form, Optimal value bounds in interval fractional linear programming and revenue efficiency measuring, Strong optimal solutions of interval linear programming, Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming, Solving interval quadratic programming problems by using the numerical method and swarm algorithms, AE solutions and AE solvability to general interval linear systems, Solution types of two-sided interval linear system and their application on interval linear programming problems, Efficient solution of a class of quantified constraints with quantifier prefix exists-forall, On approximation of the best case optimal value in interval linear programming, Integrated grey relational analysis and multi objective grey linear programming for sustainable electricity generation planning, The Worst Case Finite Optimal Value in Interval Linear Programming, On the optimal solution set in interval linear programming, The best, the worst and the semi-strong: optimal values in interval linear programming, Necessary and sufficient conditions for unified optimality of interval linear program in the general form, Bounding error of calculating the matrix functions, Inverse linear programming with interval coefficients, Closed form of \(L\)-localized solution set of MAX-plus interval linear system and its application on optimization problem, Checking weak and strong optimality of the solution to interval convex quadratic program, A cutting plane method for bilevel linear programming with interval coefficients, Interval convex quadratic programming problems in a general form, Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints, Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem, Checking weak optimality of the solution to interval linear program in the general form, Solvability and feasibility of interval linear equations and inequalities, Stability of the linear complementarity problem properties under interval uncertainty, Duality gap in interval linear programming, Finding efficient solutions in the interval multi-objective linear programming models, Weak optimal inverse problems of interval linear programming based on KKT conditions, Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases, Special issue on: Optimization methods for decision making: advances and applications, Checking weak optimality and strong boundedness in interval linear programming, Tolerance-localized and control-localized solutions of interval linear equations system and their application to course assignment problem, Unnamed Item, Solvability of Parametric Interval Linear Systems of Equations and Inequalities, A note on dependency between interval linear systems, EA solutions and EA solvability to general interval linear systems, New method for computing the upper bound of optimal value in interval quadratic program
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Optimal value range in interval linear programming
- Strong solvability of interval linear programming problems
- On the solution set of a linear equation with the right-hand side and operator given by intervals
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
- Linear programming with interval coefficients
- Introduction to Interval Analysis
- Zur lösung linearer ungleichungssysteme bei störimg der rechten seite und der koeffizientenmatrix
- Linear Programming with Inexact Data is NP‐Hard
- Linear interval inequalities
- Solvability of Systems of Linear Interval Equations
- Linear Optimization Problems with Inexact Data
