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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 08:58, 27 May 2024

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

    Statements

    Detecting IIS in infeasible linear programmes using techniques from goal programming (English)
    0 references
    0 references
    0 references
    0 references
    6 January 1997
    0 references
    goal programming
    0 references
    irreducibly inconsistent systems
    0 references

    Identifiers