by Jim Burke
Publisher: University of Washington 2012
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.
Home page url
Download or read it online for free here:
(multiple PDF files)
by A. Ben-Tal, L. El Ghaoui, A. Nemirovski - Princeton University Press
Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of this relatively new approach to optimization.
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.
by Marius Durea, Radu Strugariu - De Gruyter Open
Starting with the case of differentiable data and the classical results on constrained optimization problems, continuing with the topic of nonsmooth objects involved in optimization, the book concentrates on both theoretical and practical aspects.
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.