Tutorials On Emerging Methodologies And Applications In Operations Research

This volume reflects the theme of the INFORMS 2004 Meeting in Denver: Back to OR Roots. Emerging as a quantitative approach to problem-solving in World War II, our founders were physicists, mathematicians, and engineers who quickly found peace-time uses. It is fair to say that Operations Research (OR) was born in the same incubator as computer science, and it has spawned many new disciplines, such as systems engineering, health care management, and transportation science. Although people from many disciplines routinely use OR methods, many scientific researchers, engineers, and others do not understand basic OR tools and how they can help them. Disciplines ranging from finance to bioengineering are the beneficiaries of what we do — we take an interdisciplinary approach to problem-solving. Our strengths are modeling, analysis, and algorithm design. We provide a quanti- tive foundation for a broad spectrum of problems, from economics to medicine, from environmental control to sports, from e-commerce to computational - ometry. We are both producers and consumers because the mainstream of OR is in the interfaces. As part of this effort to recognize and extend OR roots in future probl- solving, we organized a set of tutorials designed for people who heard of the topic and want to decide whether to learn it. The 90 minutes was spent addre- ing the questions: What is this about, in a nutshell? Why is it important? Where can I learn more? In total, we had 14 tutorials, and eight of them are published here.

This volume chronicles the high impact research career of Harvey Greenberg (1940-2018), and in particular, it reviews historical contributions, presents current research projects, and suggests future pursuits. This volume addresses several of his most distinguished hallmarks, including model analysis, model generation, infeasibility diagnosis, sensitivity analysis, parametric programming, energy modeling, and computational biology. There is also an overview chapter on the emergence of computational OR, and in particular, how literature venues have changed the course of OR research. He developed Computer-Assisted Analysis in the 1970s and 80s, creating an artificially intelligent environment for analyzing mathematical programming models and their results. This earned him the first INFORMS Computing Society (ICS) Prize for "research excellence in the interfaces between operations research and computer science" in 1986, notably for his software system, ANALYZE. In 1993, he wrote the first book in the Springer OR/CS Series entitled A Computer-Assisted Analysis System for Mathematical Programming Models and Solutions: A User’s Guide for ANALYZE. He applied OR methods to CS problems, ranging from using queuing theory for optimal list structure design to using integer programming for bioinformatic database search. He also applied CS to OR problems, ranging from super-sparse information structures to the use of compiler design in ANALYZE. This book can serve as a guide to new researchers, and will report the historical trajectory of OR as it solves current problems and forecasts future applications through the accomplishments of Harvey Greenberg.

This book will help readers to better manage supply chains in emerging economics. It addresses a host of issues and challenges, from infrastructure constraints and the logistics inefficiencies to contributing to the social and environmental developments of emerging economies. Innovative approaches are outlined and illustrated with examples of real-world experiences by progressive companies and thought leaders.

This book is a comprehensive survey of the mathematical concepts and principles of industrial mathematics. Its purpose is to provide students and professionals with an understanding of the fundamental mathematical principles used in Industrial Mathematics/OR in modeling problems and application solutions. All the concepts presented in each chapter have undergone the learning scrutiny of the author and his students. The illustrative material throughout the book was refined for student comprehension as the manuscript developed through its iterations, and the chapter exercises are refined from the previous year's exercises.

In today’s global economy, operations strategy in supply chains must assume an ever-expanding and strategic role of risks. These operational and strategic facets entail a brand new set of operational problems and risks that have not always been understood or managed very well. This book provides the means to understand, to model and to analyze these outstanding issues and problems that are the essential elements in managing supply chains today.

Here is the first systematic handbook treatment of quantitative modeling natural resource problems, their allocated efficient use, and societal and economic impact. Andrés Weintraub is the very top person in Natural Resource research. He has selected co-editors who are at the top of the sub-fields in natural resources: agriculture, fisheries, forestry, and mining. The book covers these areas with contributions from researchers on, among others, modeling natural research problems, quantifying data, and developing algorithms.

Thesubjectofthisbookisthenested partitions method(NP),arelativelynew optimization method that has been found to be very e?ective solving discrete optimization problems. Such discrete problems are common in many practical applications and the NP method is thus useful in diverse application areas. It can be applied to both operational and planning problems and has been demonstrated to e?ectively solve complex problems in both manufacturing and service industries. To illustrate its broad applicability and e?ectiveness, in this book we will show how the NP method has been successful in solving complex problems in planning and scheduling, logistics and transportation, supply chain design, data mining, and health care. All of these diverse app- cationshaveonecharacteristicincommon:theyallleadtocomplexlarge-scale discreteoptimizationproblemsthatareintractableusingtraditionaloptimi- tion methods. 1.1 Large-Scale Optimization IndevelopingtheNPmethodwewillconsideroptimization problemsthatcan be stated mathematically in the following generic form: minf(x), (1.1) x?X where the solution space or feasible region X is either a discrete or bounded ? set of feasible solutions. We denote a solution to this problem x and the ? ? objective function value f = f (x ).