This book was first published in 1988 by Heldermann Verlag, Berlin, and has been out of print since 1994. The author has been receiving several enquiries about its availability. So it has been decided to provide public access to this book on the web. Dr. Samer Takriti initially took the compressed postscript files provided by the publisher and posted them on the web. However, these postscript files do not contain figures and the subject index is missing.

With partial funding prvided by Rachkam Graduate School of The University of Michigan, Ann Arbor, Dr. Vincent F. Yu completed the job of making the original book entirely available on the web.

This book provides an in-depth and clear treatment of all the important practical, technical, computational, geometric, and mathematical aspects of the Linear Complementarity Problem, Quadratic Programming, and their various applications. It discusses clearly the various algorithms for solving the LCP, presents their efficient implementation for the computer, and discusses their computational complexity. It presents the practical applications of these algorithms and extensions of these algorithms to solve general nonlinear programming problems. Finally, it surveys new methods for solving linear programs, such as Khachiyan's and Karmarkar's.