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

No abstract

No abstract

No abstract

The aim of this paper is to study, in a systematic way, relationships and first-order characterizations among several classes of vector-valued functions which are possible extensions of scalar concave, quasiconcave and pseudoconcave functions. These classes are defined by using three order relations generated by a cone C or the interior of C, or the cone C without the origin