Book Your Summer Shop NowBook Your Summer Shop Now
Add Item to wish listAdd Item to wish list

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

By Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise
Paperback
$54.99
By Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise
Promotion message icon

Premium Members save an extra 10% and all Members collect stamps to save with Rewards. 10 stamps = $5. Learn More

Formats
In stock
This item is currently out of stock online.
Free standard shipping on orders over $60
Select a store to view item availability.
Following Karmarkar's 1984 linear programming algorithm, numerous interior-point algorithms have been proposed for various mathematical programming problems such as linear programming, convex quadratic programming and convex programming in general. This monograph presents a study of interior-point algorithms for the linear complementarity problem (LCP) which is known as a mathematical model for primal-dual pairs of linear programs and convex quadratic programs. A large family of potential r...

Categories

Science & TechnologyMathematicsMathematics - Applied