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 Manifoldsby 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.
(22776 views)
Decision Making and Productivity Measurementby Dariush Khezrimotlagh - arXiv
I wrote this book as a self-teaching tool to assist every teacher, student, mathematician or non-mathematician, and to support their understanding of the elementary concepts on assessing the performance of a set of homogenous firms ...
(8720 views)
Notes on Optimizationby Pravin Varaiya - Van Nostrand
The author presents the main concepts mathematical programming and optimal control to students having diverse technical backgrounds. A reasonable knowledge of advanced calculus, linear algebra, and linear differential equations is required.
(13767 views)
Iterative Methods for Optimizationby 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.
(13273 views)