Computer Solution of Linear Programmes (Hardcover)

This self-contained book provides a systematic account of the main algorithms derived from the simplex method and the means by which they may be organized into effective procedures for solving practical linear programming problems on a computer. The book begins by characterizing the problem and the method used to solve it, and goes on to deal with the practicalities of the subject, emphasizing concerns of implementation. The final section of the book discusses the basic principles of optimization: duality, decomposition, and homotopy. In conjunction with the simplex method, they each lead to other key algorithms of linear programming. The author's approach is distinguished by his detailed exploration of ideas and issues that centre on the need to structure data suitably, and to organize calculations in an efficient and numerically stable manner. Unlike many linear programming texts, the author's overall perspective is grounded in nonlinear programming rather than combinatorics. Numerical analysts, operations researchers, control theorists, applied mathematicians.

General

Imprint:	Oxford UniversityPress
Country of origin:	United States
Series:	Monographs on Numerical Analysis
Release date:	1988
Authors:	J. L Nazareth
Dimensions:	230 x 150 x 18mm (L x W x T)
Format:	Hardcover
Pages:	244
ISBN-13:	978-0-19-504278-8
Categories:	Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	0-19-504278-6
Barcode:	9780195042788

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!