Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming

Although several classes of cutting plane methods for deterministically solving disjoint bilinear programming (DBLP) have been proposed, the frequently encountered computational issue regarding the generation of a suitable cut from a degenerate vertex in a pseudo-global minimizer (PGM) still remains. Among the approaches to dealing with degeneracy, the most recent one is to generate a conservative cut. Nevertheless, the computational performance of the corresponding distance-following algorithm for its location seems far from satisfactory. This paper proposes several approaches that can be utilized to efficiently locate a conservative hyperplane from a degenerate vertex in a PGM. Extensive experiments are conducted to evaluate their performance from the dimensionality as well as the degree of degeneracy. From the computational viewpoint, these new approaches can outperform the earlier developed distance-following algorithm, and thereby can be incorporated into cutting plane methods for solving DBLP.