Constraint Optimization

optimized_constraint

This model is an example of a constraint optimization problem. Considering a constraint of an integer programming model where all the decision variables in the constraint are binary, the goal is to find another constraint involving the same binary variables that is logically equivalent to the original constraint, but that has the smallest possible absolute value of the right-hand side. This problem is formulated as a linear programming problem using the Gurobi Python API and solved with the Gurobi Optimizer.

This model is example 18 from the fifth edition of Model Building in Mathematical Programming, by H. Paul Williams on pages 273 and 328-330.

This modeling example is at the advanced level, where we assume that you know Python and the Gurobi Python API and that you have advanced knowledge of building mathematical optimization models. Typically, the objective function and/or constraints of these examples are complex or require advanced features of the Gurobi Python API.


 

Request a Gurobi Evaluation License or Free Academic License

Modeling examples are coded using the Gurobi Python API in Jupyter Notebook. In order to use the Jupyter Notebooks, you must have a Gurobi License. If you do not have a license, you can request an Evaluation License as a Commercial User or download a free license as an Academic User.

 

Commercial Users: Free Evaluation Version Academic Users: Free Academic Version

 


 

Access the Jupyter Notebook Modeling Example

Click on the button below to be directed to GitHub where you can download the repository for the Constraint Optimization Jupyter Notebook modeling example.

 

Constraint Optimization

 


Contact Us

We’re happy to assist you. Please contact us using this form, and a Gurobi representative will get back to you shortly.

  • Free Consultations
  • General Inquiries
  • Gurobi Optimizer Questions

Can’t view the form? Please email us at sales@gurobi.com.

Thank you! The information has been submitted successfully.