Try our new documentation site (beta).
ObjBound
| Type: | double |
|---|---|
| Modifiable: | No |
The best known bound on the optimal objective. When solving a MIP model, the algorithm maintains both a lower bound and an upper bound on the optimal objective value. For a minimization model, the upper bound is the objective of the best known feasible solution, while the lower bound gives a bound on the best possible objective.
