A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
From MaRDI portal
Publication:2459386
DOI10.1016/j.cor.2006.08.007zbMath1278.90371OpenAlexW2165559311WikidataQ59140349 ScholiaQ59140349MaRDI QIDQ2459386
Paula Amaral, Hanif D. Sherali, Joaquim Joao Júdice
Publication date: 6 November 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.08.007
Related Items (13)
K-best feasible clusters - ranking optimal solutions from an infeasible LP ⋮ A review of recent advances in global optimization ⋮ Best approximate solutions of inconsistent linear inequality systems ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality ⋮ On the quadratic fractional optimization with a strictly convex quadratic constraint ⋮ Copositivity and constrained fractional quadratic problems ⋮ Optimal correction of infeasible equations system as Ax + B|x|= b using ℓ p-norm regularization ⋮ Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems ⋮ Automatic repair of convex optimization problems ⋮ Optimal error correction and methods of feasible directions ⋮ On the optimal correction of infeasible systems of linear inequalities ⋮ On optimal zero-preserving corrections for inconsistent linear systems
Uses Software
Cites Work
- Unnamed Item
- Irreducibly inconsistent systems of linear inequalities
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- MINOS(IIS): Infeasibility analysis using MINOS
- Some results concerning post-infeasibility analysis
- Some perturbation theory for linear programming
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Consistency, redundancy, and implied equalities in linear systems
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- A framework for optimal correction of inconsistent linear constraints
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- Approaches to Diagnosing Infeasible Linear Programs
- INCONSISTENT STRUCTURES OF LINEAR SYSTEMS
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- An LP-based algorithm for the correction of inconsistent linear equation and inequality systems
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Enhancements of ANALYZE
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Nonlinear Programming
This page was built for publication: A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
