**Linear Complementarity, Linear and Nonlinear Programming**

by Katta G. Murty

1997**Number of pages**: 613

**Description**:

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.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Discrete Optimization**

by

**Guido Schaefer**-

**Utrecht University**

From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.

(

**4458**views)

**Linear Programming**

by

**Jim Burke**-

**University of Washington**

These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.

(

**3517**views)

**Universal Optimization and Its Application**

by

**Alexander Bolonkin**-

**viXra.org**

This book describes new method of optimization (''Method of Deformation of Functional'') that has the advantages at greater generality and flexibility as well as the ability to solve complex problems which other methods cannot solve.

(

**1634**views)

**The Design of Approximation Algorithms**

by

**D. P. Williamson, D. B. Shmoys**-

**Cambridge University Press**

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.

(

**10463**views)