A cutting plane algorithm for solving bilinear programs

This paper addresses itself to a special class of nonconvex quadratic program referred to as a bilinear program in the literature. We will propose here a cutting plane algorithm to solve this class of problems. The algorithm is along the lines of H. Tui and K. Ritter, but it differs in its exploitation of the special structure of the problem. Though the algorithm is not guaranteed at this stage of the research to converge to a global optimum, the preliminary results of numerical experiments are encouraging.This research was partially supported by the Office of Naval Research under Contract N-00014-67-A-0112-0011; and U.S. Atomic Energy Commission Contract AT(04-3)-326-PA # 18.