I am trying to solve an optimisation problem with Lindo as a solver but it gives me the near optimal solution as you can see on the results below. I have tried to add as an option a lower Rel. MIP Gap and Abs. MIP Gap but it does not work. Can anyone help please?
#BRANCHs #NODEs #LPs BEST BOUND BEST IP RGAP TIME OPTIME
(CUTPASS) (NUMCUT) (SUMFP) (CODE)
0 0 2 2.706218e+10 2.736380e+10 1.1e-02 0.49 (*FP)
0 0 3 2.706218e+10 2.734504e+10 1.0e-02 0.52 (*SRH)
0 0 3 2.706218e+10 2.734504e+10 1.0e-02 0.52 0.33
Optimum found
Status : 1
Objective Value : 27345038770.4
Best Bound : 27062177733.4
Rel. MIP Gap : 1.034414e-02
Abs. MIP Gap : 2.828610e+08
Primal Infeasibility : 1.668930e-06
Integer Infeasibility : 0.000000e+00
Total Branches : 0
Total LPs Solved : 3
Simplex Iterations : 4547
Barrier Iterations : 0
Nonlinear Iterations : 0
Cutting planes applied : 0 (0)
Total Time (sec.) : 0.52