Overview
Computational Techniques of the Simplex Method is a systematic treatment focused on the computational issues of the simplex method. It provides a comprehensive coverage of the most important and successful algorithmic and implementation techniques of the simplex method. It is a unique source of essential, never discussed details of algorithmic elements and their implementation. On the basis of the book the reader will be able to create a highly advanced implementation of the simplex method which, in turn, can be used directly or as a building block in other solution algorithms.
Full Product Details
Author: István Maros
Publisher: Springer-Verlag New York Inc.
Imprint: Springer-Verlag New York Inc.
Edition: Softcover reprint of the original 1st ed. 2003
Volume: 61
Dimensions:
Width: 15.50cm
, Height: 1.80cm
, Length: 23.50cm
Weight: 0.534kg
ISBN: 9781461349907
ISBN 10: 1461349907
Pages: 325
Publication Date: 31 October 2012
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Paperback
Publisher's Status: Active
Availability: Manufactured on demand
We will order this item for you from a manufactured on demand supplier.
Reviews
This is really a nice, long awaited book...it covers all important aspects and techniques needed for an efficient, robust implementation of the simplex method...it deserves a place on the bookshelf of every OR, optimization professional, it could be marketed as handbook of computational techniques . (Tamas Terlaky, Dept. of Computing and Software, McMaster University, Hamilton, ON, Canada) The book will be of great interest to people developing advanced LP solver codes customized for special purposes, and solvers for integer programming and combinatorial optimization, and also for researchers working in these areas. It is an ideal textbook for graduate courses in computational mathematical programming. It deserves to be in the personal library of software engineers dealing with numerical computation involving linear constraints. (K.G. Murty, for the American Mathematical Society, MathSciNet Mathematical Reviews on the web)
This is really a nice, long awaited book...it covers all important aspects and techniques needed for an efficient, robust implementation of the simplex method...it deserves a place on the bookshelf of every OR, optimization professional, it could be marketed as handbook of computational techniques . (Tamas Terlaky, Dept. of Computing and Software, McMaster University, Hamilton, ON, Canada) The book will be of great interest to people developing advanced LP solver codes customized for special purposes, and solvers for integer programming and combinatorial optimization, and also for researchers working in these areas. It is an ideal textbook for graduate courses in computational mathematical programming. It deserves to be in the personal library of software engineers dealing with numerical computation involving linear constraints. (K.G. Murty, for the American Mathematical Society, MathSciNet Mathematical Reviews on the web)
