Type: int
Modifiable: No

Index of linear constraint with the largest (unscaled) slack bound violation for continuous linear models solved by simplex.

For MIP or other situations, it is for all the constraints. The constraint order is linear, quadratic, SOS and general. Assume there are <span>$</span>l<span>$</span> linear, <span>$</span>q<span>$</span> quadratic, <span>$</span>s<span>$</span> SOS and <span>$</span>g<span>$</span> general constraints and the index <span>$</span>i<span>$</span> is between <span>$</span>l+q+s<span>$</span> and <span>$</span>l+q+s+g<span>$</span>, then the general constraint with index <span>$</span>i-l-q-s<span>$</span> has the biggest violation.

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.