Article citationsMore>>

J. W. Chinneck, “An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem,” Annals of Mathematics and Artificial Intelligence, Vol. 17, No. 1, 1996, pp. 127-144. doi:10.1007/BF02284627

has been cited by the following article:

• TITLE: Diagnosis and Resolution of Infeasibility in the Constraint Method for Solving Multi Objective Linear Programming Problems

  AUTHORS: Mohammadreza Safi, Hossein Zare Marzooni

  KEYWORDS: Multi Objective Linear Programming; Weighting Method; Constraint Method; Infeasibility Analysi; IIS

  JOURNAL NAME: American Journal of Operations Research, Vol.2 No.3, September 18, 2012

  ABSTRACT: In this paper we discuss about infeasibility diagnosis and infeasibility resolution, when the constraint method is used for solving multi objective linear programming problems. We propose an algorithm for resolution of infeasibility, which is a combination of interactive, weighting and constraint methods.Numerical examples are provided to illustrate the techniques developed.