Nehodí sa? Žiadny problém! U nás môžete do 30 dní vrátiť
S darčekovým poukazom nešliapnete vedľa. Obdarovaný si za darčekový poukaz môže vybrať čokoľvek z našej ponuky.
30 dní na vrátenie tovaru
Linear Programming and Network Flows presents the problem of minimizing and maximizing a linear function in the presence of linear equality or inequality constraints. This text provides methods for modeling complex problems via effective algorithms on modern computers, optimization problems, and effective solution algorithms. The book also explores linear programming and network flows, polynomial-time algorithms, and geometric concepts. This modified edition includes new exercises, comments, and references on recent developments, like the geometry of cycling. This is the only text that covers both linear programming techniques and network flows for students.
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?