Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program (Q4354937)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program |
scientific article; zbMATH DE number 1062428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program |
scientific article; zbMATH DE number 1062428 |
Statements
Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program (English)
0 references
3 May 1998
0 references
large linear programs
0 references
irreducible inconsistent systems
0 references
0.899780809879303
0 references
0.8882930874824524
0 references
0.8373780250549316
0 references
0.8314657807350159
0 references
