Dynamic Programming and Optimal Control by D. P. Bertsekas			Introduction to Probability by D. P. Bertsekas and J. N. Tsitsiklis		Convex Optimization Theory by D. P. Bertsekas
	Nonlinear Programming NEW! 2016 by D. P. Bertsekas			Introduction to Linear Optimization by D. Bertsimas and J. N. Tsitsiklis		Convex Optimization Algorithms NEW! 2015 by D. P. Bertsekas
	Neuro-Dynamic Programming by D. P. Bertsekas and J. N. Tsitsiklis			Network Optimization: Continuous and Discrete Models by D. P. Bertsekas
	Convex Analysis and Optimization by D. P. Bertsekas with A. Nedic and A. E. Ozdaglar			Parallel and Distributed Computation: Numerical Methods NEW HARDCOVER! 2015 by D. P. Bertsekas and J. N. Tsitsiklis
	Abstract Dynamic Programming by D. P. Bertsekas			Constrained Optimization and Lagrange Multiplier Methods by D. P. Bertsekas
	Network Flows and Monotropic Optimization by R. T. Rockafellar			Stochastic Optimal Control: The Discrete-Time Case by D. P. Bertsekas and S. Shreve

The first six (counting left to right) are textbooks currently used on a regular basis in M.I.T. courses. The next four have been used in graduate courses at M.I.T., and were developed through instruction in these courses. The last four deal with research issues in optimization, computation, and control. All books are well suited for self-study or in-class instruction.

Click on any individual book icon for information on that book, or click here for a complete list.

Special Discount

Order electronically, by email, by mail, or by FAX, three or more different books in a single order, and you will receive an automatic discount of 10% from the list price.

Special Arrangements for Courses Outside of North America

Please contact us for special shipping, discount, and other arrangements for courses in universities outside of North America.

Software

Software related to our publications. This software is copyright-protected, but may be freely downloaded and used for nonprofit research or instructional purposes.

• Misc network optimization codes by Dimitri P. Bertsekas
• RELAX4 code by Dimitri P. Bertsekas and Paul Tseng, and RELAX4 documentation for linear single commodity network optimization.
• C++ Implementation of RELAX4 code from the University of Pisa
• AUCTION and other algorithms, for linear cost assignment, shortest path, and other network flow problems.
• Newton's method for unconstrained optimization problems by Dimitri P. Bertsekas.

For Further Information: