On optimal zero-preserving corrections for inconsistent linear systems
type: Item
instance of: scholarly article
title: On optimal zero-preserving corrections for inconsistent linear systems
zbMATH Open document ID: 1180.90304
author: Paula Amaral
author: L. Fernandes
author: Hanif D. Sherali
author: Joaquim J. Júdice
published in: Journal of Global Optimization
publication date: 2009-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 5641563
zbMATH Keywords: infeasible systems
zbMATH Keywords: nonlinear programming
zbMATH Keywords: fractional programming
zbMATH Keywords: global optimization
describes a project that uses: MINOS
describes a project that uses: LINDO
describes a project that uses: GAMS
MaRDI profile type: Publication
full work available at URL: s10898-009-9403-5
OpenAlex ID: W2129479713
Wikidata QID: Q59140348
cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations
cites work: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
cites work: Connections between the total least squares and the correction of an infeasible system of linear inequalities
cites work: A framework for optimal correction of inconsistent linear constraints
cites work: A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
cites work: Nonlinear Programming
cites work: Some results concerning post-infeasibility analysis
cites work: MINOS(IIS): Infeasibility analysis using MINOS
cites work: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
cites work: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
cites work: Consistency, redundancy, and implied equalities in linear systems
cites work: Enhancements of ANALYZE
cites work: Approaches to Diagnosing Infeasible Linear Programs
cites work: Analyzing Infeasible Mixed-Integer and Integer Linear Programs
cites work: Q4889854
cites work: Introduction to global optimization.
cites work: The global solver in the LINDO API
cites work: Irreducibly inconsistent systems of linear inequalities
cites work: Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
cites work: Some perturbation theory for linear programming
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: Detecting IIS in infeasible linear programmes using techniques from goal programming
cites work: Q3745619
cites work: An LP-based algorithm for the correction of inconsistent linear equation and inequality systems
cites work: Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
cites work: INCONSISTENT STRUCTURES OF LINEAR SYSTEMS
DBLP publication ID: journals/jgo/AmaralFJS09
DOI: 10.1007/S10898-009-9403-5
description: scientific article; zbMATH DE number 5641563