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

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

(

**6127**views)

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

(

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

(

**5842**views)

**Convex Optimization: Algorithms and Complexity**

by

**Sebastien Bubeck**-

**arXiv.org**

This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.

(

**651**views)