Products of problem variables appear naturally in quadratic programs. Special preprocessing, linearization, and cutting plane techniques are available to deal with such products. If at least one of the two variables in a product is binary, then the product can be modeled using a set of linear constraints.
As a consequence, there are many mixed-integer linear programs (MILPs) that actually contain products of variables hidden in their constraint structure. Rediscovering these product relationships between the variables enables us to exploit the solving techniques for product terms.
In this webinar, we will:
You can download the materials associated with this webinar here.
Choose the evaluation license that fits you best, and start working with our Expert Team for technical guidance and support.
Request free trial hours, so you can see how quickly and easily a model can be solved on the cloud.