0
$\begingroup$

I know that a constrained linear optimization problem can be transformed into an unconstrained binary quadratic optimization problem (UBQP). Does anyone know if the inverse result is solved in the literature? Is there a procedure to transform a UBQP problem into a constrained binary linear programming problem?

Improve this question
$\endgroup$

1 Answer 1

Reset to default
1
$\begingroup$

Yes, the linearization of a product of binary variables is well known: https://or.stackexchange.com/questions/37/how-to-linearize-the-product-of-two-binary-variables

Improve this answer
$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .