In this paper, we investigate the convergence properties of the Fletcher Reeves algorithm. Under conditions weaker than those in a paper of M. A1-Baali,we get t
A locally semicomplete digraph is a digraph D=(V,A) satisfying the following condi-tion for every vertex x∈V the D[O(x)] and D[I(x)] are semicomplete digraphs.