Robert J. Vanderbei

New York Times bestsellerJourney into the universe through the most spectacular sights in astronomy in stereoscopic 3DWelcome to the Universe in 3D takes you on a grand tour of the observable universe, guiding you through the most spectacular sights in the cosmos—in breathtaking 3D. Presenting a rich array of stereoscopic color images, which can be viewed in 3D using a special stereo viewer that folds easily out of the cover of the book, this book reveals your cosmic environment as you have never seen it before. Astronomy is the story of how humankind's perception of the two-dimensional dome of the sky evolved into a far deeper comprehension of an expanding three-dimensional cosmos. This book invites you to take part in this story by exploring the universe in depth, as revealed by cutting-edge astronomical research and observations. You will journey from the Moon through the solar system, out to exoplanets, distant nebulas, and galaxy clusters, until you finally reach the cosmic microwave background radiation (or CMB), the most distant light we can observe. The distances to these celestial wonders range from 1.3 light-seconds to 13.8 billion light-years. Along the way, the authors explain the fascinating features of what you are seeing, including how the 3D images were made using the same technique that early astronomers devised to measure distances to objects in space. The dramatic 3D images in this one-of-a-kind book will astonish you, extending your vision out to the farthest reaches of the universe. You will never look up into the night sky the same way again.

The book provides a broad introduction to both the theory and the application of optimization with a special emphasis on the elegance, importance, and usefulness of the parametric self-dual simplex method. The book assumes that a problem in “standard form,” is a problem with inequality constraints and nonnegative variables. The main new innovation to the book is the use of clickable links to the (newly updated) online app to help students do the trivial but tedious arithmetic when solving optimization problems. The latest edition now includes: a discussion of modern Machine Learning applications, as motivational material; a section explaining Gomory Cuts and an application of integer programming to solve Sudoku problems. Readers will discover a host of practical business applications as well as non-business applications. Topics are clearly developed with many numerical examples worked out in detail. Specific examples and concrete algorithms precede more abstract topics. With its focus on solving practical problems, the book features free C programs to implement the major algorithms covered, including the two-phase simplex method, the primal-dual simplex method, the path-following interior-point method, and and the homogeneous self-dual method. In addition, the author provides online tools that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and online pivot tools can be found on the book's website. The website also includes new online instructional tools and exercises.

The book provides a broad introduction to both the theory and the application of optimization with a special emphasis on the elegance, importance, and usefulness of the parametric self-dual simplex method. The book assumes that a problem in “standard form,” is a problem with inequality constraints and nonnegative variables. The main new innovation to the book is the use of clickable links to the (newly updated) online app to help students do the trivial but tedious arithmetic when solving optimization problems. The latest edition now includes: a discussion of modern Machine Learning applications, as motivational material; a section explaining Gomory Cuts and an application of integer programming to solve Sudoku problems. Readers will discover a host of practical business applications as well as non-business applications. Topics are clearly developed with many numerical examples worked out in detail. Specific examples and concrete algorithms precede more abstract topics. With its focus on solving practical problems, the book features free C programs to implement the major algorithms covered, including the two-phase simplex method, the primal-dual simplex method, the path-following interior-point method, and and the homogeneous self-dual method. In addition, the author provides online tools that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and online pivot tools can be found on the book's website. The website also includes new online instructional tools and exercises.

This book offers a first course in analysis for scientists and engineers. It can be used at the advanced undergraduate level or as part of the curriculum in a graduate program. The book is built around metric spaces. In the first three chapters, the authors lay the foundational material and cover the all-important “four-C’s”: convergence, completeness, compactness, and continuity. In subsequent chapters, the basic tools of analysis are used to give brief introductions to differential and integral equations, convex analysis, and measure theory. The treatment is modern and aesthetically pleasing. It lays the groundwork for the needs of classical fields as well as the important new fields of optimization and probability theory.

This book offers a first course in analysis for scientists and engineers. It can be used at the advanced undergraduate level or as part of the curriculum in a graduate program. The book is built around metric spaces. In the first three chapters, the authors lay the foundational material and cover the all-important “four-C’s”: convergence, completeness, compactness, and continuity. In subsequent chapters, the basic tools of analysis are used to give brief introductions to differential and integral equations, convex analysis, and measure theory. The treatment is modern and aesthetically pleasing. It lays the groundwork for the needs of classical fields as well as the important new fields of optimization and probability theory.

This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.£/LIST£.

This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.£/LIST£.