Type: double
Modifiable: No

Reporting constraint violations for the simplex solver is actually more complex than it may appear, due to the treatment of slacks on linear inequality constraints. The simplex solver introduces explicit non-negative slack variables inside the algorithm. Thus, for example, <span>$</span>a^Tx \le b<span>$</span> becomes <span>$</span>a^Tx + s = b<span>$</span>. In this formulation, constraint errors can show up in two places: (i) as bound violations on the computed slack variable values, and (ii) as differences between <span>$</span>a^Tx + s<span>$</span> and <span>$</span>b<span>$</span>. We report the former as ConstrVio and the latter as ConstrResidual.

For MIP models, the maximum violation of the constraints, including linear, quadratic, SOS and general constraints, is reported in ConstrVio.

Available for all model types.

For examples of how to query or modify attributes, refer to our Attribute Examples.

Try Gurobi for Free

Choose the evaluation license that fits you best, and start working with our Expert Team for technical guidance and support.

Evaluation License
Get a free, full-featured license of the Gurobi Optimizer to experience the performance, support, benchmarking and tuning services we provide as part of our product offering.
Academic License
Gurobi supports the teaching and use of optimization within academic institutions. We offer free, full-featured copies of Gurobi for use in class, and for research.
Cloud Trial

Request free trial hours, so you can see how quickly and easily a model can be solved on the cloud.