A note on resolving infeasibility in linear programs by constraint relaxation

  • Authors:

  • Jayaram K Sankaran

  • Affiliations:

  • Department of Management Studies, Indian Institute of Science, Bangalore, India

  • Venue:
  • Operations Research Letters
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.