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

**Linear Complementarity, Linear and Nonlinear Programming**

by

**Katta G. Murty**

This book provides an in-depth and clear treatment of all the important practical, technical, computational, geometric, and mathematical aspects of the Linear Complementarity Problem, Quadratic Programming, and their various applications.

(

**6264**views)

**Applied Mathematical Programming Using Algebraic Systems**

by

**Bruce A. McCarl, Thomas H. Spreen**-

**Texas A&M University**

This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.

(

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

(

**1750**views)

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

(

**11293**views)