Thoroughly revised, this leading text on linear programming introduces new material on the simplex algorithm, polynomially- bounded algorithms and other algorithmic procedures. It gives ample consideration to the practical implementation of the simplex algorithm and its extensions, and features excellent coverage of Karmarkar's Algorithm, a new area of considerable research interest. The text contains all the material needed for not only a linear programming course but also a course on network flows.

Rese�a del editor

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

BooksRun helps to save money on textbooks. We are committed to providing each customer with the highest standard of customer service. Please pay close attention to the description of the book and its condition you are ordering. If you have any questions or issues, please make sure to contact us first so we could resolve them. All orders are shipped on the same or the next business day. It usually takes 1 to 5 business days to receive your item if you choose expedited shipping. All orders submitted are eligible for a return within 30 days after the delivery. Thanks for shopping with us!

Zur Homepage des Verk�ufers