Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
From MaRDI portal
Publication:4354937
DOI10.1287/IJOC.9.2.164zbMATH Open0885.90077OpenAlexW2023761583MaRDI QIDQ4354937FDOQ4354937
Authors: John W. Chinneck 
Publication date: 3 May 1998
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.9.2.164
Recommendations
Cited In (31)
- Mathematical formulations for consistent travelling salesman problems
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- A hybrid algorithm for solving linear inequalities in a least squares sense
- A fuzzy method to repair infeasibility in linearly constrained problems
- Finding duplicate rows in a linear programming model
- Identifying relatively irreducible infeasible subsystems of linear inequalities
- Approaches to Diagnosing Infeasible Linear Programs
- Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables
- Some results concerning post-infeasibility analysis
- Automatic repair of convex optimization problems
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- K-best feasible clusters - ranking optimal solutions from an infeasible LP
- Solution techniques for the large set covering problem
- Optimization approaches to supervised classification
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Preferential reducts and constructs in robust multiple criteria ranking and sorting
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Generalized filtering algorithms for infeasibility analysis
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Infeasibility resolution based on goal programming
- On optimal zero-preserving corrections for inconsistent linear systems
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- Valid cycles: A source of infeasibility in open shortest path first routing
- Efficient algorithms for finding critical subgraphs
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Harvey Greenberg: analyzing infeasible mathematical programs
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Identifying Minimally Infeasible Subsystems of Inequalities
- Irreducible infeasible subsystems of semidefinite systems
Uses Software
This page was built for publication: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354937)
