Article ID Journal Published Year Pages File Type
4639677 Journal of Computational and Applied Mathematics 2012 11 Pages PDF
Abstract

The aim of this paper is to propose a solution algorithm for a particular class of rank-two nonconvex programs having a polyhedral feasible region. 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.

Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, ,