Affordable Access

Publisher Website

Irreducibly inconsistent systems of linear inequalities

Authors
Journal
European Journal of Operational Research
0377-2217
Publisher
Elsevier
Publication Date
Volume
8
Issue
3
Identifiers
DOI: 10.1016/0377-2217(81)90177-6
Disciplines
  • Computer Science

Abstract

Abstract Irreducibly inconsistent systems of linear inequalities are considered from the point of view of applying simplex-like methods for investigation. We give necessary and sufficient conditions, for a system to be irreducibly inconsistent, which can be found by applying a simplex algorithm. Next we consider general inconsistent systems. The simplex method can be used to identify irreducibly inconsistent subsystem. Such subsystems can give structural insight in the inconsistency and are used in trying to make the overall system consistent. This can be done in an easy way e.g. by right-hand side manipulations. Finally the problem of finding a ‘cheapest’ way of doing this can be formulated and solved as an extended linear program.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Han-type algorithms for inconsistent systems of li...

on Applied Mathematics and Comput...

Han-type algorithms for inconsistent systems of li...

on Applied Mathematics and Comput... Nov 01, 2014

A note on infinite systems of linear inequalities...

on Journal of Mathematical Analys... Jan 01, 1974
More articles like this..