Mixed-integer bilinear programming problems
This paper considers the bilinear programming problem with one set of variables restricted to be binary values. The authors describe some special cases of the problem which admit more efficient solution procedures. A composite Lagrangian relaxation cutting plane algorithm is given for the more general case. Some computational results are presented for comparing different algorithmic steps.
composite Lagrangian relaxation cutting plane algorithm
scientific article; zbMATH DE number 429090
scientific article