A Modern Approach to Teaching an Introduction to Optimization (eng)

Optimization should be the science of making the best possible decisions. Making decisions is a virtually universal human activity encountered by professionals (in any field) or people in their everyday lives. You would think, then, that the study of making good decisions is a subject that should be taught broadly to students throughout engineering, the physical and social sciences, business, and policy. Yet today, “optimization” is widely taught as a mathematically sophisticated subject, often limited to graduate students in specialized fields. In operations research (or industrial engineering), “optimization” is equivalent to deterministic math programming, starting with linear programs (and the simplex algorithm), and then transitioning through integer linear programs and nonlinear programs. If you are in departments like electrical or mechanical engineering, optimization means teaching optimal control. And if you are in computer science, optimization today could be interpreted in the context of machine learning (such as fitting models to data) or as reinforcement learning.

This book claims that the traditional style of teaching optimization is misguided and out of date. First, while the simplex algorithm is a powerful strategy for solving linear programs, the details of the simplex algorithm are completely inappropriate in an introductory course in optimization. Second, while linear programs are appropriate for solving many problems, they are only applicable to a tiny fraction of all decisions. Third, linear programs (along with integer and nonlinear programs) are static models for problems with (typically) vector-valued decisions. By contrast, most decisions are sequential since they are made periodically over time as new information is arriving. In addition, the vast majority of these decisions are scalar (possibly continuous or discrete).

This book is designed for instructors (or potential instructors) looking to introduce the science of making good decisions to the broadest possible audience. It should also be of interest to anyone who has already had a traditional course in optimization of any type. The presentation is organized around a series of topics that suggest a fundamentally different approach to teaching “optimization” spanning both sequential decision problems (which offer the simplest problem settings) before transitioning to more complex vector-valued decisions. It also makes the case that most problems which are modeled as linear (or integer, or nonlinear programs) are actually methods for making decisions in a sequential setting. For this reason, these topics are introduced with much less emphasis on algorithms than is traditionally used, both in static and sequential settings.

Warren B. Powell is Professor Emeritus at Princeton University, where he taught for 39 years, and is currently Chief Analytics Officer at Optimal Dynamics. He is the founder and director of CASTLE Labs, which developed models and algorithms in stochastic optimization, with applications to energy systems, transportation, health, e-commerce, and the laboratory sciences (see www.castlelab.princeton.edu). He has pioneered the use of approximate dynamic programming for high-dimensional applications, and the knowledge gradient for active learning problems. His recent work has focused on developing a unified framework for sequential decision problems under uncertainty, spanning active learning to a wide range of dynamic resource allocation problems. He has authored books on Approximate Dynamic Programming and (with Ilya Ryzhov) Optimal Learning, and is the author of Reinforcement Learning and Stochastic Optimization: A unified framework for sequential decisions.