Penalty Parameter for Linearly Constrained 0-1 Quadratic Programming

摘要

A linearly constrained 0-1 quadratic programming problem is proved to be equivalent to a continuous concave quadratic problem with an easily computed penalty parameter. Moreover, it is proved that the feasibility of the former problem can be checked by solving the latter.