Author : Aaart R. Heesterman
Publisher : Springer
ISBN 13 :
Total Pages : 816 pages
Book Rating : 4.47/5 ( download)
Book Synopsis Matrices and Simplex Algorithms by : Aaart R. Heesterman
Download or read book Matrices and Simplex Algorithms written by Aaart R. Heesterman and published by Springer. This book was released on 1983 with total page 816 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides an introduction to the theory and application of a range of mathematical programming algorithms, a nd to the prerequisite fields of linear algebra and the graphical presentation of a number of rational functions. The algorithms offered cover matrix inversion, linear programming, quadratic programming with linear side-conditions, quadratic programming with quadratic side-conditions, and integer programming. The resolution of mixed systems of equations and inequalities; systems with sign-constrained and free variables; and the accommodation of upper and lower limbs in specified variables without explicitly written restrictions are discussed, for linear programming, as well as for quadratic programming with linear side-conditions. Of the algorithms provided, the sequentially constrained maximization method for solving the general quantitive programming problem is, in part, novel. The other algorithms are, in outline, established methods. There is however, a more direct approach to the problem of the infeasible starting solution and, as a result, a less rigid separation between the traditional I and II than is usual.