A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Following Karmarkar's 1984 linear programming algorithm,numerous interior-point algorithms have been proposed forvarious mathematical programming problems such as linearprogramming, convex quadratic programming and convexprogramming in general. This monograph presents a study ofinterior-point algorithms for the linear complementarityproblem (LCP) which is known as a mathematical model forprimal-dual pairs of linear programs and convex quadraticprograms. A large family of potential reduction algorithmsis presented in a unified way for the class of LCPs wherethe underlying matrix ha…
Mehr
CHF 86.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V103:
Folgt in ca. 5 Arbeitstagen
Produktdetails
Weitere Autoren: Megiddo, Nimrod / Noma, Toshihito / Yoshise, Akiko
- ISBN: 978-3-540-54509-5
- EAN: 9783540545095
- Produktnummer: 3260992
- Verlag: Springer Berlin Heidelberg
- Sprache: Englisch
- Erscheinungsjahr: 1991
- Seitenangabe: 120 S.
- Masse: H23.9 cm x B16.3 cm x D1.3 cm 216 g
- Auflage: 1991
- Abbildungen: Paperback
- Gewicht: 216
Bewertungen
Anmelden