In science, engineering and economics, decision problems are frequently modelled by optimizing the value of a (primary) objective function under stated feasibility constraints. In many cases of practical relevance, the optimization problem structure does not warrant the global optimality of local solutions; hence, it is natural to search for the globally best solution(s). Global Optimization in Action provides a comprehensive discussion of adaptive partition strategies to solve global optimization problems under very general structural requirements. A unified approach to numerous known algorithms makes possible straightforward generalizations and extensions, leading to efficient computer-based implementations. A considerable part of the book is devoted to applications, including some generic problems from numerical analysis, and several case studies in environmental systems analysis and management. The book is essentially self-contained and is based on the author's research, in cooperation (on applications) with a number of colleagues. Audience: Professors, students, researchers and other professionals in the fields of operations research, management science, industrial and applied mathematics, computer science, engineering, economics and the environmental sciences.

In 1995 the Handbook of Global Optimization (first volume), edited by R. Horst, and P.M. Pardalos, was published. This second volume of the Handbook of Global Optimization is comprised of chapters dealing with modern approaches to global optimization, including different types of heuristics. Topics covered in the handbook include various metaheuristics, such as simulated annealing, genetic algorithms, neural networks, taboo search, shake-and-bake methods, and deformation methods. In addition, the book contains chapters on new exact stochastic and deterministic approaches to continuous and mixed-integer global optimization, such as stochastic adaptive search, two-phase methods, branch-and-bound methods with new relaxation and branching strategies, algorithms based on local optimization, and dynamical search. Finally, the book contains chapters on experimental analysis of algorithms and software, test problems, and applications.

In science, engineering and economics, decision problems are frequently modelled by optimizing the value of a (primary) objective function under stated feasibility constraints. In many cases of practical relevance, the optimization problem structure does not warrant the global optimality of local solutions; hence, it is natural to search for the globally best solution(s). Global Optimization in Action provides a comprehensive discussion of adaptive partition strategies to solve global optimization problems under very general structural requirements. A unified approach to numerous known algorithms makes possible straightforward generalizations and extensions, leading to efficient computer-based implementations. A considerable part of the book is devoted to applications, including some generic problems from numerical analysis, and several case studies in environmental systems analysis and management. The book is essentially self-contained and is based on the author's research, in cooperation (on applications) with a number of colleagues. Audience: Professors, students, researchers and other professionals in the fields of operations research, management science, industrial and applied mathematics, computer science, engineering, economics and the environmental sciences.

One of the most well-known of all network optimization problems is the shortest path problem, where a shortest connection between two locations in a road network is to be found. This problem is the basis of route planners in vehicles and on the Internet. Networks are very common structures; they consist primarily of a ?nite number of locations (points, nodes), together with a number of links (edges, arcs, connections) between the locations. Very often a certain number is attached to the links, expressing the distance or the cost between the end points of that connection. Networks occur in an extremely wide range of applications, among them are: road networks; cable networks; human relations networks; project scheduling networks; production networks; distribution networks; neural networks; networks of atoms in molecules. In all these cases there are “objects” and “relations” between the objects. A n- work optimization problem is actually nothing else than the problem of ?nding a subset of the objects and the relations, such that a certain optimization objective is satis?ed.

A unique examination of the civic use, regulation, and politics of communication and data technologies City life has been reconfigured by our use—and our expectations—of communication, data, and sensing technologies. This book examines the civic use, regulation, and politics of these technologies, looking at how governments, planners, citizens, and activists expect them to enhance life in the city. Alison Powell argues that the de facto forms of citizenship that emerge in relation to these technologies represent sites of contention over how governance and civic power should operate. These become more significant in an increasingly urbanized and polarized world facing new struggles over local participation and engagement. The author moves past the usual discussion of top-down versus bottom-up civic action and instead explains how citizenship shifts in response to technological change and particularly in response to issues related to pervasive sensing, big data, and surveillance in "smart cities".

This self-contained textbook is an informal introduction to optimization through the use of numerous illustrations and applications. The focus is on analytically solving optimization problems with a finite number of continuous variables. In addition, the authors provide introductions to classical and modern numerical methods of optimization and to dynamic optimization. The book's overarching point is that most problems may be solved by the direct application of the theorems of Fermat, Lagrange, and Weierstrass. The authors show how the intuition for each of the theoretical results can be supported by simple geometric figures. They include numerous applications through the use of varied classical and practical problems. Even experts may find some of these applications truly surprising. A basic mathematical knowledge is sufficient to understand the topics covered in this book. More advanced readers, even experts, will be surprised to see how all main results can be grounded on the Fermat-Lagrange theorem. The book can be used for courses on continuous optimization, from introductory to advanced, for any field for which optimization is relevant.

This volume presents a selection of advanced case studies that address a substantial range of issues and challenges arising in space engineering. The contributing authors are well-recognized researchers and practitioners in space engineering and in applied optimization. The key mathematical modeling and numerical solution aspects of each application case study are presented in sufficient detail. Classic and more recent space engineering problems – including cargo accommodation and object placement, flight control of satellites, integrated design and trajectory optimization, interplanetary transfers with deep space manoeuvres, low energy transfers, magnetic cleanliness modeling, propulsion system design, sensor system placement, systems engineering, space traffic logistics, and trajectory optimization – are discussed. Novel points of view related to computational global optimization and optimal control, and to multidisciplinary design optimization are also given proper emphasis. A particular attention is paid also to scenarios expected in the context of future interplanetary explorations. Modeling and Optimization in Space Engineering will benefit researchers and practitioners working on space engineering applications. Academics, graduate and post-graduate students in the fields of aerospace and other engineering, applied mathematics, operations research and optimal control will also find the book useful, since it discusses a range of advanced model development and solution techniques and tools in the context of real-world applications and new challenges.

Active Calculus - single variable is a free, open-source calculus text that is designed to support an active learning approach in the standard first two semesters of calculus, including approximately 200 activities and 500 exercises. In the HTML version, more than 250 of the exercises are available as interactive WeBWorK exercises; students will love that the online version even looks great on a smart phone. Each section of Active Calculus has at least 4 in-class activities to engage students in active learning. Normally, each section has a brief introduction together with a preview activity, followed by a mix of exposition and several more activities. Each section concludes with a short summary and exercises; the non-WeBWorK exercises are typically involved and challenging. More information on the goals and structure of the text can be found in the preface.

In recent years global optimization has found applications in many interesting areas of science and technology including molecular biology, chemical equilibrium problems, medical imaging and networks. The collection of papers in this book indicates the diverse applicability of global optimization. Furthermore, various algorithmic, theoretical developments and computational studies are presented. Audience: All researchers and students working in mathematical programming.

There has been much recent progress in global optimization algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fundamental role in the analysis and development of global optimization algorithms. This is due to the fact that virtually all nonconvex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held June 5-9, 2000 at Pythagorian, Samos, Greece. It was in honor of the memory of C. Caratheodory (1873-1950). It was endorsed by the Mathematical Programming Society (MPS) and by the Society for industrial and Applied Mathematics (SIAN) Activity Group in Optimization. This volume contains a selection of refereed papers based on invited and contributing talks presented at the conference. The two themes of convexity and global optimization pervade the book. The conference provided a forum for researchers working on different aspects of convexity and global optimization to present their recent discoveries, and to interact with people working on complementary aspects of mathematical programming. Audience: Faculty, graduate students, and researchers in mathematical programming, computer science, and engineering.