Detecting IIS in infeasible linear programmes using techniques from goal programming

M. Tamiz; S. J. Mardle; D. F. Jones

doi:10.1016/0305-0548(95)00018-H

Detecting IIS in infeasible linear programmes using techniques from goal programming

M. Tamiz^*, S. J. Mardle, D. F. Jones

^*Corresponding author for this work

School of Mathematics & Physics

Research output: Contribution to journal › Article › peer-review

Abstract

This paper presents ideas from goal programming (GP) used as an accompaniment to linear programming (LP) for the analysis of LP infeasibility. A new algorithm (GPIIS) for the detection of irreducibly inconsistent systems (IIS) of constraints is presented using this approach. The structure necessary for implementing such a procedure into a commercial LP solver is outlined. Results for a selection of infeasible LP problems are given, and conclusions drawn.

Original language	English
Pages (from-to)	113-119
Number of pages	7
Journal	Computers and Operations Research
Volume	23
Issue number	2
DOIs	https://doi.org/10.1016/0305-0548(95)00018-H
Publication status	Published - Feb 1996

Access to Document

10.1016/0305-0548(95)00018-H

Cite this

@article{1b8b8f083af8477ba8ae7bb3a181caf3,

title = "Detecting IIS in infeasible linear programmes using techniques from goal programming",

abstract = "This paper presents ideas from goal programming (GP) used as an accompaniment to linear programming (LP) for the analysis of LP infeasibility. A new algorithm (GPIIS) for the detection of irreducibly inconsistent systems (IIS) of constraints is presented using this approach. The structure necessary for implementing such a procedure into a commercial LP solver is outlined. Results for a selection of infeasible LP problems are given, and conclusions drawn.",

author = "M. Tamiz and Mardle, {S. J.} and Jones, {D. F.}",

year = "1996",

month = feb,

doi = "10.1016/0305-0548(95)00018-H",

language = "English",

volume = "23",

pages = "113--119",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Limited",

number = "2",

}

TY - JOUR

T1 - Detecting IIS in infeasible linear programmes using techniques from goal programming

AU - Tamiz, M.

AU - Mardle, S. J.

AU - Jones, D. F.

PY - 1996/2

Y1 - 1996/2

N2 - This paper presents ideas from goal programming (GP) used as an accompaniment to linear programming (LP) for the analysis of LP infeasibility. A new algorithm (GPIIS) for the detection of irreducibly inconsistent systems (IIS) of constraints is presented using this approach. The structure necessary for implementing such a procedure into a commercial LP solver is outlined. Results for a selection of infeasible LP problems are given, and conclusions drawn.

AB - This paper presents ideas from goal programming (GP) used as an accompaniment to linear programming (LP) for the analysis of LP infeasibility. A new algorithm (GPIIS) for the detection of irreducibly inconsistent systems (IIS) of constraints is presented using this approach. The structure necessary for implementing such a procedure into a commercial LP solver is outlined. Results for a selection of infeasible LP problems are given, and conclusions drawn.

UR - http://www.scopus.com/inward/record.url?scp=0012709468&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(95)00018-H

DO - 10.1016/0305-0548(95)00018-H

M3 - Article

AN - SCOPUS:0012709468

SN - 0305-0548

VL - 23

SP - 113

EP - 119

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 2

ER -

Detecting IIS in infeasible linear programmes using techniques from goal programming

Abstract

Access to Document

Fingerprint

Cite this