Lectures on Optimization: Theory and Algorithms
by John Cea
Publisher: Tata Institute of Fundamental Research 1978
Number of pages: 237
Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals - Theory; Minimization Without Constraints - Algorithms; Minimization with Constraints - Algorithms; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.
Download or read it online for free here:
by Jim Burke - University of Washington
These are notes for 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.
by Ian Craw - University of Aberdeen
The book describes the simplex algorithm and shows how it can be used to solve real problems. It shows how previous results in linear algebra give a framework for understanding the simplex algorithm and describes other optimization algorithms.
by Guido Schaefer - Utrecht University
From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; 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.