Reformulation-Convexification Technique for Polynomial Programs: Design and Implementation
In Chapter 7, we discussed the design and theory of a Reformulation-Linearization Technique for solving polynomial programming problems. We now return to this class of problems, but this time, we shall focus on specific implementation issues and describe various algorithmic strategies and additional classes of RLT constraints that can be gainfully employed in enhancing the performance of an RLT-based solution procedure. For the sake of convenience, we restate below the type of polynomial programming problems considered here, as introduced in Chapter 7.
KeywordsLinear Programming Relaxation Algorithmic Strategy Quadratic Inequality Multivariate Problem Quadratic Equality
Unable to display preview. Download preview PDF.