tbfp-network
dual-infeasible
The instance
as published- Variables
- 72,747
- Constraints
- 2,434
- Nonzeros
- 211,166
- Format
- MPS, gzipped
Where it comes from
provenanceThe source instance's LP relaxation is feasible with a bounded optimum. Removing the elements below makes the objective unbounded, and putting any one of them back makes it bounded again.
- Bounds dropped
- 8
- Rows dropped
- 2
What was removed
10 entriesrow Visit_Once_Network['Globe_Life_Park_in_Arlington']row Visit_Once_Network['Kauffman_Stadium']lb of UseArc[891,1004]lb of UseArc[881,891]lb of UseArc[778,881]ub of UseArc[946,1004]lb of UseArc[946,959]lb of UseArc[923,2405]ub of UseArc[778,2405]ub of UseArc[923,959]
10 of 10 shown. The complete list is in the sidecar.