刊名:Mathematical Methods of Operations Research (ZOR)
出版年:2010
出版时间:February, 2010
年:2010
卷:71
期:1
页码:165-180
全文大小:220.1 KB
文摘
In this paper a solution algorithm for a class of rank-two nonconvex programs having a polyhedral feasible region is proposed. The algorithm is based on the so called optimal level solutions method. Various global optimality conditions are discussed and implemented in order to improve the efficiency of the algorithm.