Reformulation-Convexification Technique for Quadratic Programs and Some Convex Envelope Characterizations
In the previous chapter, we have presented general concepts and theory for using RLT to solve polynomial problems. In the present chapter, we discuss certain specialized RLT results and implementation strategies, focusing on the global optimization of nonconvex quadratic programming problems.
KeywordsFeasible Region Select Constraint Convex Envelope Incumbent Solution Original Constraint
Unable to display preview. Download preview PDF.