MILP Infeasibility

[Santha]

oops. here is the file. 

[RobPratt]

threshold=1059.1293009

NOTE: Problem generation will use 4 threads.
NOTE: The problem has 350026 variables (0 free, 0 fixed).
NOTE: The problem has 350026 binary and 0 integer variables.
NOTE: The problem has 351095 linear constraints (349615 LE, 1480 EQ, 0 GE, 0 range).
NOTE: The problem has 1049254 linear constraint coefficients.
NOTE: The problem has 0 nonlinear constraints (0 LE, 0 EQ, 0 GE, 0 range).
NOTE: The OPTMODEL presolver is disabled for linear problems.
NOTE: The initial MILP heuristics are applied.
NOTE: The MILP presolver value AUTOMATIC is applied.
NOTE: The MILP presolver removed 4 variables and 0 constraints.
NOTE: The MILP presolver removed 4 constraint coefficients.
NOTE: The MILP presolver modified 0 constraint coefficients.
NOTE: The presolved problem has 350022 variables, 351095 constraints, and 1049250 constraint
      coefficients.
NOTE: The MILP solver is called.
NOTE: The parallel Branch and Cut algorithm is used.
NOTE: The Branch and Cut algorithm is using up to 4 threads.
          Node   Active   Sols    BestInteger      BestBound      Gap    Time
             0        1      1      300164209      300164209    0.00%     289
             0        0      1      300164209      300164209    0.00%     289
NOTE: Optimal.
NOTE: Objective = 300164208.62.
507  quit;
NOTE: PROCEDURE OPTMODEL used (Total process time):
      real time           6:11.50
      user cpu time       6:10.32
      system cpu time     2.67 seconds
      memory              2787007.45k
      OS Memory           2809256.00k
      Timestamp           08/27/2021 07:38:59 PM
      Step Count                        13  Switch Count  15

[Santha]

Rob

Great. This works perfectly fine for me now. Thanks a lot for all your help as usual. Amazing you are.