A new linearization technique for multi-quadratic 0–1 programming problems

0.00 Avg rating—0 Votes

Article ID:	iaor2005752
Country:	Netherlands
Volume:	32
Issue:	6
Start Page Number:	517
End Page Number:	522
Publication Date:	Nov 2004
Journal:	Operations Research Letters
Authors:	Pardalos Panos M., Chaovalitwongse Wanpracha, Prokopyev Oleg A.
Keywords:	programming: integer

Abstract:

We consider the reduction of multi-quadratic 0–1 programming problems to linear mixed 0–1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0–1 variables and k is the number of quadratic constraints). The number of 0–1 variables remains the same.

Reviews

Required fields are marked *. Your email address will not be published.