Redundancy elimination with a lexicographic solved form (Q1380440): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Redundancy in mathematical programming. A state-of-the-art survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3929386 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Standard forms for rational linear arithmetic in constraint logic programming. / rank | |||
Normal rank | |||
Revision as of 11:19, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Redundancy elimination with a lexicographic solved form |
scientific article |
Statements
Redundancy elimination with a lexicographic solved form (English)
0 references
25 May 1998
0 references
detection of redundant linear constraints
0 references
syntactic criteria
0 references
