**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

**Notes on Optimization**

by

**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.

(

**12183**views)

**Lectures on Optimization: Theory and Algorithms**

by

**John Cea**-

**Tata Institute of Fundamental Research**

Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals; Minimization Without Constraints; Minimization with Constraints; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.

(

**11144**views)

**Decision Making and Productivity Measurement**

by

**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 ...

(

**7032**views)

**The Design of Approximation Algorithms**

by

**D. P. Williamson, D. B. Shmoys**-

**Cambridge University Press**

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.

(

**16368**views)