Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product

► Positive convex Half-Product problem is studied, with and without a linear constraint. ► A constant ration approximation algorithm and an FPTAS are derived. ► The running times depend quadratically on the number of variables. ► Several scheduling applications are presented.