A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs

    loading  Checking for direct PDF access through Ovid


In this paper, we propose an algorithm for solving a linear program with an additional rank-two reverse convex constraint. Unlike the existing methods which generate approximately optimal solutions, the algorithm provides a rigorous optimal solution to this nonconvex problem by a finite number of dual pivot operations. Computational results indicate that the algorithm is practical and can solve fairly large scale problems.

Related Topics

    loading  Loading Related Articles