A note on resolving infeasibility in linear programs by constraint relaxation (Q2367035)
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: A note on resolving infeasibility in linear programs by constraint relaxation |
scientific article; zbMATH DE number 232582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on resolving infeasibility in linear programs by constraint relaxation |
scientific article; zbMATH DE number 232582 |
Statements
A note on resolving infeasibility in linear programs by constraint relaxation (English)
0 references
16 August 1993
0 references
post-infeasibility analysis
0 references
constraint relaxation
0 references
polynomial-time solvability
0 references
totally unimodular matrix
0 references
0.7798740863800049
0 references
0.7715864777565002
0 references
0.7657160758972168
0 references
0.7513383030891418
0 references
0.7495639324188232
0 references
