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

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

(

**3968**views)

**Optimal Stopping and Applications**

by

**Thomas S. Ferguson**-

**UCLA**

From the table of contents: Stopping Rule Problems; Finite Horizon Problems; The Existence of Optimal Rules; Applications. Markov Models; Monotone Stopping Rule Problems; Maximizing the Rate of Return; Bandit Problems; Solutions to the Exercises.

(

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

(

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

(

**13906**views)