Matrices and Simplex Algorithms

Aaart R. Heesterman

ISBN 10: 9400979436 / ISBN 13: 9789400979437

Published by Springer Netherlands, Springer Nov 2011, 2011

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -This is a textbook devoted to mathematical programming algorithms and the mathematics needed to understand such algorithms. It was mainly written for economists, but the mathematics itself obviously has relevance for other disciplines. It is a textbook as well a~ in parts, a contribution to new knowledge. There is, accordingly, a broad ordering of climbing sophistication, the earlier chapters being purely for the student, the later chapters being more specialist and containing some element of novelty on certain points. The book is edited in five parts. Part I deals with elementary matrix operations, matrix inversion, determinants, etc. Part II is mainly devoted to linear programming. As far as students' readability is concerned, these two parts are elementary undergraduate material. However, I would claim, in particular with respect to linear programming, that I do things more efficiently than the standard textbook approach has it. This refers mainly to the search for a feasible solution i.e. Chapter 9, and to upper and lower limits, i.e. Chapter 10. I have also argued that the standard textbook treatment of degeneracy misses a relevant problem, namely that of accuracy. In short, I would invite anyone who has the task of writing or designing an LP-code, to first acquaint himself with my ideas. viii INTRODUCTION Parts III and IV are concerned with nonlinear programming.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 804 pp. Englisch.

Seller Inventory # 9789400979437

Bibliographic Details

• Title: Matrices and Simplex Algorithms
• Publisher: Springer Netherlands, Springer Nov 2011
• Publication Date: 2011
• Language: English
• ISBN 10: 9400979436
• ISBN 13: 9789400979437
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 43D millimeters 235 millimeters width by 155 millimeters height by 43 millimeters depth
• Weight: 1194 grams

About this title

Synopsis

This is a textbook devoted to mathematical programming algorithms and the mathematics needed to understand such algorithms. It was mainly written for economists, but the mathematics itself obviously has relevance for other disciplines. It is a textbook as well a~ in parts, a contribution to new knowledge. There is, accordingly, a broad ordering of climbing sophistication, the earlier chapters being purely for the student, the later chapters being more specialist and containing some element of novelty on certain points. The book is edited in five parts. Part I deals with elementary matrix operations, matrix inversion, determinants, etc. Part II is mainly devoted to linear programming. As far as students' readability is concerned, these two parts are elementary undergraduate material. However, I would claim, in particular with respect to linear programming, that I do things more efficiently than the standard textbook approach has it. This refers mainly to the search for a feasible solution i.e. Chapter 9, and to upper and lower limits, i.e. Chapter 10. I have also argued that the standard textbook treatment of degeneracy misses a relevant problem, namely that of accuracy. In short, I would invite anyone who has the task of writing or designing an LP-code, to first acquaint himself with my ideas. viii INTRODUCTION Parts III and IV are concerned with nonlinear programming.

Review

`The textbook will be very helpful to the reader acquainted with the basic concepts of mathematical programming and interested in numerical details as well as in efficient codes. It will also benefit students as a resource for numerical examples and code details.'
Optima: Mathematical Programming Society Newsletter, 18 (1986)