Reduce variables in linear equality constraints
AnsweredHi,
I would ask whether there is a Gurobi API that finds and reduce the variables in linear equality constraints. As for linear constraints, some variables could be represented by others, thus this approach could serve as a general approach to reduce the complexity of a problem. I read the presolve function API and it seems that presolve does not deal with this case. Are there some ways to do so?
Thanks for your help!
-
Official comment
This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support. -
What you are describing is called "variable substitution" and Gurobi certainly uses that during the presolving routine. You can read more about the various presolving techniques here: OPUS 4 | Presolve Reductions in Mixed Integer Programming (kobv.de)
I have also added that reference to our guide on presolving: How does presolve work? – Gurobi Help Center
I hope that helps.
Cheers,
Matthias0 -
Hi,
That resolved my question, and thanks for your prompt answer and detailed reference on presolve!
Best regards,
Haoyu
0
Post is closed for comments.
Comments
3 comments