Code: 41476945
This book discusses one of the most recent developments in interior-point methods, the arc-search techniques. Introducing these techniques result in an efficient interior-point algorithm with the lowest polynomial bound, which sol ... more
English
You get 191 loyalty points
Book synopsis
This book discusses one of the most recent developments in interior-point methods, the arc-search techniques. Introducing these techniques result in an efficient interior-point algorithm with the lowest polynomial bound, which solves a long-standing issue of the interior-point methods in linear programming.
Book details
78.79 €
English
Collection points Bratislava a 12892 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25788 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )
You are here: