Guide book says there being a **NO-PRODUCT rule**, which forbids products between unconstant expressions. I am dealing with a binary quadratically constrained linear program (0-1 QCLP), and one of my constraints is as bellows:

**(a x.’).((b*x.’)-c)>=0**

where

**x**is a

**1*N vector variable**;

**a**and

**b**are

**N*1 constant vectors**;

**c**is a

**constant**. Which means (a

*x.’) and (b*x.’) are constant. It should be a simple inequality. But I cannot make it conform to

**NO-PRODUCT rule**.

If someone could help, I would be grateful. Thanks~~~