Consistency, redundancy, and implied equalities in linear systems
From MaRDI portal
Publication:1380438
DOI10.1007/BF02284624zbMath0887.90114OpenAlexW2065229701MaRDI QIDQ1380438
Publication date: 4 March 1998
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02284624
Linear programming (90C05) Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10)
Related Items (26)
The maximum feasible subset problem (maxFS) and applications ⋮ How to compute least infeasible flows ⋮ Finding the minimum weight IIS cover of an infeasible system of linear inequalities ⋮ Feasibility in capacitated networks: The effect of individual arcs and nodes ⋮ Minimum equivalent precedence relation systems ⋮ Minimal representations of a face of a convex polyhedron and some applications ⋮ Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs ⋮ On the Role of a Market Maker in Networked Cournot Competition ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Saturation in linear optimization ⋮ Feasibility in reverse convex mixed-integer programming ⋮ Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Determining the right-hand vectors of an irredundant linear inequality system ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ The ANALYZE rulebase for supporting LP analysis ⋮ On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems ⋮ On optimal zero-preserving corrections for inconsistent linear systems ⋮ Uniform saturation in linear inequality systems ⋮ Excess information in parametric linear optimization ⋮ Analytic centers and repelling inequalities ⋮ A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries ⋮ Redundant disequalities in the Latin square problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Redundancy in mathematical programming. A state-of-the-art survey
- Constraint classification in mathematical programming
- A theorem on flows in networks
- Consistency of a linear system of inequalities
- General criteria for redundant and nonredundant linear inequalities
- Note on prime representations of convex polyhedral sets
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Irreducibly inconsistent systems of linear inequalities
- Minimal representation of convex polyhedral sets
- A canonical form for generalized linear constraints
- A geometric view of parametric linear programming
- Weakly redundant constraints and their impact on postoptimal analyses in LP
- A computer-assisted analysis system for mathematical programming models and solutions. A user's guide for ANALYZE. Incl. 1 disk
- MINOS(IIS): Infeasibility analysis using MINOS
- The facets of the polyhedral set determined by the Gale-Hoffman inequalities
- Some results concerning post-infeasibility analysis
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Practical issues on the projection of polyhedral sets
- Redundancy elimination with a lexicographic solved form
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Feasibility in capacitated networks: The effect of individual arcs and nodes
- Gainfree Leontief substitution flow problems
- Minimal representation of quadratically constrained convex feasible regions
- A pathological case in the reduction of linear programs
- Elementare Theorie der konvexen Polyeder
- Feasibility in uncapacitated networks: The effect of individual arcs and nodes
- A note on resolving infeasibility in linear programs by constraint relaxation
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Management Models and Industrial Applications of Linear Programming
- Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- Linear Inequalities and Related Systems. (AM-38)
- A Network-Flow Feasibility Theorem and Combinatorial Applications
- Formal optimization of some reduced linear programming problems
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- An analysis of degeneracy
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
- Preprocessing in Stochastic Programming: The Case of Linear Programs
- Approaches to Diagnosing Infeasible Linear Programs
- Incremental Linear Constraint Solving and Detection of Implicit Equalities
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
- Identifying Minimally Infeasible Subsystems of Inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- Preprocessing in Stochastic Programming: The Case of Capacitated Networks
- Achievable potential reductions in the method of Kojima et al. in the case of linear programming
- Localizing and Diagnosing Infeasibilities in Networks
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- Systems of Linear Relations
This page was built for publication: Consistency, redundancy, and implied equalities in linear systems
