Linear Programming
by Jim Burke
Publisher: University of Washington 2012
Description:
An introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig since it offers a complete framework for discussing both the geometry and duality theory for linear programs.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books
Optimization Algorithms on Matrix Manifolds
by P.-A. Absil, R. Mahony, R. Sepulchre - Princeton University Press
Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.
(17887 views)
by P.-A. Absil, R. Mahony, R. Sepulchre - Princeton University Press
Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.
(17887 views)
Iterative Methods for Optimization
by C.T. Kelley - Society for Industrial Mathematics
This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis.
(10790 views)
by C.T. Kelley - Society for Industrial Mathematics
This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis.
(10790 views)
Discrete Optimization
by Guido Schaefer - Utrecht University
From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.
(9051 views)
by Guido Schaefer - Utrecht University
From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.
(9051 views)
Convex Optimization
by Stephen Boyd, Lieven Vandenberghe - Cambridge University Press
A comprehensive introduction to the subject for students and practitioners in engineering, computer science, mathematics, statistics, finance, etc. The book shows in detail how optimization problems can be solved numerically with great efficiency.
(19065 views)
by Stephen Boyd, Lieven Vandenberghe - Cambridge University Press
A comprehensive introduction to the subject for students and practitioners in engineering, computer science, mathematics, statistics, finance, etc. The book shows in detail how optimization problems can be solved numerically with great efficiency.
(19065 views)