Shu-Cherng Fang, NC State ISE, Linear Reformulation of Polynomial Discrete Programming for Fast Computation
SAS 4201Optimization models involving a polynomial objective function and multiple polynomial constraints with discrete variables are often encountered in engineering, management and systems. Treating the non-convex cross-product terms is the key. State-of- the-art methods usually convert such a problem into a 0-1 mixed integer linear programming problem, and, then adopt a branch-and- bound scheme to find…