Reformulation-Convexification Technique for Quadratic Programs and Some Convex Envelope Characterizations

  • Hanif D. Sherali
  • Warren P. Adams
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 31)


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.


Feasible Region Select Constraint Convex Envelope Incumbent Solution Original Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1999

Authors and Affiliations

  • Hanif D. Sherali
    • 1
  • Warren P. Adams
    • 2
  1. 1.Department of Industrial and Systems EngineeringVirginia Polytechnic Institute and State UniversityBlacksburgUSA
  2. 2.Department of Mathematical SciencesClemson UniversityClemsonUSA

Personalised recommendations