A Note on Reduction of Quadratic and Bilinear Programs with Equality Constraints

, , and

BibTeX reference

Reduction of some classes of global optimization programs to bilinear programs may be done in various ways, and the choice of method clearly influences the ease of solution of the resulting problem. In this note we show how linear equality constraints may be used together with graph theoretic tools to reduce a bilinear program, i.e., eliminate variables from quadratic terms to minimize the number of complicating variables. The method is illustrated on an example. Computer results are reported on known test problems.

, 11 pages

This cahier was revised in June 2001

Research Axis

Research application