Linear Optimisation and Numerical Analysis

Small book cover: Linear Optimisation and Numerical Analysis

Linear Optimisation and Numerical Analysis

Publisher: University of Aberdeen
Number of pages: 151

The overall aim of the course is: to describe the simplex algorithm and show how it can be used to solve real problems; to show how previous results in linear algebra give a framework for understanding the simplex algorithm; and to place the simplex algorithm in a more general context by describing other calculus-based and computer based optimization algorithms.

Download or read it online for free here:
Download link
(1.1MB, PDF)

Similar books

Book cover: Robust Geometric ComputationRobust Geometric Computation
by - New York University
Contents: Introduction to Geometric Nonrobustness; Modes of Numerical Computation; Geometric Computation; Arithmetic Approaches; Geometric Approaches; Exact Geometric Computation; Perturbation; Filters; Algebraic Background; Zero Bounds; etc.
Book cover: Numerical Algorithms: Methods for Computer Vision, Machine Learning, and GraphicsNumerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics
by - CRC Press
Using examples from a broad base of computational tasks, including data processing and computational photography, the book introduces numerical modeling and algorithmic design from a practical standpoint and provides insight into theoretical tools.
Book cover: Introduction to Numerical MethodsIntroduction to Numerical Methods
by - The Hong Kong University
This is primarily for non-mathematics majors and is required by several engineering departments. Contents: IEEE Arithmetic; Root Finding; Systems of equations; Least-squares approximation; Interpolation; Integration; Ordinary differential equations.
Book cover: Numerical Analysis for EngineeringNumerical Analysis for Engineering
by - University of Waterloo
Contents: Error Analysis, Numeric Representation, Iteration, Linear Algebra, Interpolation, Least Squares, Taylor Series, Bracketing, The Five Techniques, Root Finding, Optimization, Differentiation, Integration, Initial-value Problems, etc.