Ebiefung, A.A. and Kostreva, M.M. (1992) Global Solvability of Generalized Complementarity Problems and a Related Class of Polynomial Complementarity Problems. In: Floudas, C. and Pardalos, P., Eds., Recent Advances in Global Optimization, Princeton University Press, New Jersey, 102-124.

has been cited by the following article:

• TITLE: A Direct Algorithm for the Vertical Generalized Complementarity Problem Associated with P-Matrices

  AUTHORS: Aniekan Ebiefung, George Habetler, Michael Kostreva, Bohdan Szanc

  KEYWORDS: Complementarity Problems, P-Matrix, Direct Algorithms, Linear Programming, Bi-Matrix Game

  JOURNAL NAME: Open Journal of Optimization, Vol.6 No.3, August 16, 2017

  ABSTRACT: We present a direct algorithm for solving the vertical generalized linear complementarity problem, first considered by Cottle and Dantzig, when the associated matrix is a vertical block P-matrix. The algorithm converges to a unique solution in a finite number of steps, without an assumption of nondegeneracy on the given problem. The algorithm is simple, efficient, and easy to implement.