Detecting IIS in infeasible linear programmes using techniques from goal programming (Q2563884): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINOS(IIS): Infeasibility analysis using MINOS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Minimally Infeasible Subsystems of Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of goal programming and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibly inconsistent systems of linear inequalities / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127213137 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(95)00018-h / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981066696 / rank
 
Normal rank

Latest revision as of 10:59, 30 July 2024

scientific article
Language Label Description Also known as
English
Detecting IIS in infeasible linear programmes using techniques from goal programming
scientific article

    Statements

    Identifiers