The authors present a new formal framework for finding the long-run competitive market equilibrium through short-run equilibria by exploiting the operating policies and plant valuations. This "short-run approach" develops ideas of Boiteux and Koopmans. Applied to the peak-load pricing of electricity generated by thermal, hydro and pumped-storage plants, it gives a sound and practical method of valuing the fixed assets-in this case, the river flows and the geological sites suitable for reservoirs. Its main mathematical basis is the producer's short-run profit maximization programme and its dual; their solutions have relatively simple forms that can greatly ease the fixed-point problem of solving for the general equilibrium. Since the optimal values (profit and cost functions) are usually nondifferentiable-this is so when there are joint costs of production such as capacity constraints-nonsmooth calculus is employed to resolve long-standing discrepancies between textbook theory and industrial reality by giving subdifferential extensions of basic results of microeconomics, including the Wong-Viner Envelope Theorem.

Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Toth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.

With the proliferation of Software-as-a-Service (SaaS) offerings, it is becoming increasingly important for individual SaaS providers to operate their services at a low cost. This book investigates SaaS from the perspective of the provider and shows how operational costs can be reduced by using "multi tenancy," a technique for consolidating a large number of customers onto a small number of servers. Specifically, the book addresses multi tenancy on the database level, focusing on in-memory column databases, which are the backbone of many important new enterprise applications. For efficiently implementing multi tenancy in a farm of databases, two fundamental challenges must be addressed, (i) workload modeling and (ii) data placement. The first involves estimating the (shared) resource consumption for multi tenancy on a single in-memory database server. The second consists in assigning tenants to servers in a way that minimizes the number of required servers (and thus costs) based on the assumed workload model. This step also entails replicating tenants for performance and high availability. This book presents novel solutions to both problems.

Presenting a study of geometric action functionals (i.e., non-negative functionals on the space of unparameterized oriented rectifiable curves), this monograph focuses on the subclass of those functionals whose local action is a degenerate type of Finsler metric that may vanish in certain directions, allowing for curves with positive Euclidean length but with zero action. For such functionals, criteria are developed under which there exists a minimum action curve leading from one given set to another. Then the properties of this curve are studied, and the non-existence of minimizers is established in some settings. Applied to a geometric reformulation of the quasipotential of Wentzell-Freidlin theory (a subfield of large deviation theory), these results can yield the existence and properties of maximum likelihood transition curves between two metastable states in a stochastic process with small noise. The book assumes only standard knowledge in graduate-level analysis; all higher-level mathematical concepts are introduced along the way.

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.

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes. In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and commu nicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance - this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.

Victor Isakov This volume contains various results on partial di?erential equations where Sobolev spaces are used. Their selection is motivated by the research int- ests of the editor and the geographicallinks to the places where S. L. Sobolev worked and lived: St. Petersburg, Moscow, and Novosibirsk. Most of the papers are written by leading experts in control theory and inverse pr- lems. Another reason for the selection is a strong link to applied areas. In my opinion, control theory and inverse problems are main areas of di?er- tial equations of importance for some branches of contemporary science and engineering. S. L. Sobolev, as many great mathematicians, was very much motivated by applications. He did not distinguished between pure and - plied mathematics, but, in his own words, between "good mathematics and bad mathematics. " While he possessed a brilliant analytical technique, he most valued innovative ideas, solutions of deep conceptual problems, and not mathematical decorations, perfecting exposition, and "generalizations. " S. L. Sobolev himself never published papers on inverse problems or c- trol theory, but he was very much aware of the state of art and he monitored research on inverse problems. In particular, in his lecture at a Conference on Di?erentialEquationsin1954(found inSobolev'sarchiveandmadeavailable to me by Alexander Bukhgeim), he outlined main inverse problems in g- physics: theinverseseismicproblem, theelectromagneticprospecting, andthe inverse problem of gravimetry.

This book shows how the use of S-variables (SVs) in enhancing the range of problems that can be addressed with the already-versatile linear matrix inequality (LMI) approach to control can, in many cases, be put on a more unified, methodical footing. Beginning with the fundamentals of the SV approach, the text shows how the basic idea can be used for each problem (and when it should not be employed at all). The specific adaptations of the method necessitated by each problem are also detailed. The problems dealt with in the book have the common traits that: analytic closed-form solutions are not available; and LMIs can be applied to produce numerical solutions with a certain amount of conservatism. Typical examples are robustness analysis of linear systems affected by parametric uncertainties and the synthesis of a linear controller satisfying multiple, often  conflicting, design specifications. For problems in which LMI methods produce conservative results, the SV approach is shown to achieve greater accuracy. The authors emphasize the simplicity and easy comprehensibility of the SV approach and show how it can be implemented in programs without difficulty so that its power becomes readily apparent. The S-variable Approach to LMI-based Robust Control is a useful reference for academic control researchers, applied mathematicians and graduate students interested in LMI methods and convex optimization and will also be of considerable assistance to practising control engineers faced with problems of conservatism in their systems and controllers.

Optimal analysis is defined as an analysis that creates and uses sparse, well-structured and well-conditioned matrices. The focus is on efficient methods for eigensolution of matrices involved in static, dynamic and stability analyses of symmetric and regular structures, or those general structures containing such components. Powerful tools are also developed for configuration processing, which is an important issue in the analysis and design of space structures and finite element models. Different mathematical concepts are combined to make the optimal analysis of structures feasible. Canonical forms from matrix algebra, product graphs from graph theory and symmetry groups from group theory are some of the concepts involved in the variety of efficient methods and algorithms presented. The algorithms elucidated in this book enable analysts to handle large-scale structural systems by lowering their computational cost, thus fulfilling the requirement for faster analysis and design of future complex systems. The value of the presented methods becomes all the more evident in cases where the analysis needs to be repeated hundreds or even thousands of times, as for the optimal design of structures by different metaheuristic algorithms. The book is of interest to anyone engaged in computer-aided analysis and design and software developers in this field. Though the methods are demonstrated mainly through skeletal structures, continuum models have also been added to show the generality of the methods. The concepts presented are not only applicable to different types of structures but can also be used for the analysis of other systems such as hydraulic and electrical networks.

This special volume is a collection of outstanding more applied articles presented in AMAT 2015 held in Ankara, May 28-31, 2015, at TOBB Economics and Technology University. The collection is suitable for Applied and Computational Mathematics and Engineering practitioners, also for related graduate students and researchers. Furthermore it will be a useful resource for all science and engineering libraries. This book includes 29 self-contained and well-edited chapters that can be among others useful for seminars in applied and computational mathematics, as well as in engineering.

As Richard Bellman has so elegantly stated at the Second International Conference on General Inequalities (Oberwolfach, 1978), "There are three reasons for the study of inequalities: practical, theoretical, and aesthetic." On the aesthetic aspects, he said, "As has been pointed out, beauty is in the eye of the beholder. However, it is generally agreed that certain pieces of music, art, or mathematics are beautiful. There is an elegance to inequalities that makes them very attractive." The content of the Handbook focuses mainly on both old and recent developments on approximate homomorphisms, on a relation between the Hardy-Hilbert and the Gabriel inequality, generalized Hardy-Hilbert type inequalities on multiple weighted Orlicz spaces, half-discrete Hilbert-type inequalities, on affine mappings, on contractive operators, on multiplicative Ostrowski and trapezoid inequalities, Ostrowski type inequalities for the Riemann-Stieltjes integral, means and related functional inequalities, Weighted Gini means, controlled additive relations, Szasz-Mirakyan operators, extremal problems in polynomials and entire functions, applications of functional equations to Dirichlet problem for doubly connected domains, nonlinear elliptic problems depending on parameters, on strongly convex functions, as well as applications to some new algorithms for solving general equilibrium problems, inequalities for the Fisher's information measures, financial networks, mathematical models of mechanical fields in media with inclusions and holes.

This volume contains a selection of contributions that were presented at the Modeling and Optimization: Theory and Applications Conference (MOPTA) held at Lehigh University in Bethlehem, Pennsylvania, USA on July 30-August 1, 2012. The conference brought together a diverse group of researchers and practitioners, working on both theoretical and practical aspects of continuous or discrete optimization. Topics presented included algorithms for solving convex, network, mixed-integer, nonlinear, and global optimization problems, and addressed the application of optimization techniques in finance, logistics, health, and other important fields. The contributions contained in this volume represent a sample of these topics and applications and illustrate the broad diversity of ideas discussed at the meeting.

This self-contained introduction shows how stochastic geometry techniques can be used for studying the behaviour of heterogeneous cellular networks (HCNs). The unified treatment of analytic results and approaches, collected for the first time in a single volume, includes the mathematical tools and techniques used to derive them. A single canonical problem formulation encompassing the analytic derivation of Signal to Interference plus Noise Ratio (SINR) distribution in the most widely-used deployment scenarios is presented, together with applications to systems based on the 3GPP-LTE standard, and with implications of these analyses on the design of HCNs. An outline of the different releases of the LTE standard and the features relevant to HCNs is also provided. A valuable reference for industry practitioners looking to improve the speed and efficiency of their network design and optimization workflow, and for graduate students and researchers seeking tractable analytical results for performance metrics in wireless HCNs.

This book introduces multiagent planning under uncertainty as formalized by decentralized partially observable Markov decision processes (Dec-POMDPs). The intended audience is researchers and graduate students working in the fields of artificial intelligence related to sequential decision making: reinforcement learning, decision-theoretic planning for single agents, classical multiagent planning, decentralized control, and operations research.

A unified methodology for categorizing various complex objects is presented in this book. Through probability theory, novel asymptotically minimax criteria suitable for practical applications in imaging and data analysis are examined including the special cases such as the Jensen-Shannon divergence and the probabilistic neural network. An optimal approximate nearest neighbor search algorithm, which allows faster classification of databases is featured. Rough set theory, sequential analysis and granular computing are used to improve performance of the hierarchical classifiers. Practical examples in face identification (including deep neural networks), isolated commands recognition in voice control system and classification of visemes captured by the Kinect depth camera are included. This approach creates fast and accurate search procedures by using exact probability densities of applied dissimilarity measures. This book can be used as a guide for independent study and as supplementary material for a technically oriented graduate course in intelligent systems and data mining. Students and researchers interested in the theoretical and practical aspects of intelligent classification systems will find answers to: - Why conventional implementation of the naive Bayesian approach does not work well in image classification? - How to deal with insufficient performance of hierarchical classification systems? - Is it possible to prevent an exhaustive search of the nearest neighbor in a database?

The overall structure of this new edition is three-tier: Part I presents the basics, Part II is concerned with methodological issues, and Part III discusses advanced topics. In the second edition the authors have reorganized the material to focus on problems, how to represent them, and then how to choose and design algorithms for different representations. They also added a chapter on problems, reflecting the overall book focus on problem-solvers, a chapter on parameter tuning, which they combined with the parameter control and "how-to" chapters into a methodological part, and finally a chapter on evolutionary robotics with an outlook on possible exciting developments in this field. The book is suitable for undergraduate and graduate courses in artificial intelligence and computational intelligence, and for self-study by practitioners and researchers engaged with all aspects of bioinspired design and optimization.

Sobolev spaces become the established and universal language of partial differential equations and mathematical analysis. Among a huge variety of problems where Sobolev spaces are used, the following important topics are the focus of this volume: boundary value problems in domains with singularities, higher order partial differential equations, local polynomial approximations, inequalities in Sobolev-Lorentz spaces, function spaces in cellular domains, the spectrum of a Schrodinger operator with negative potential and other spectral problems, criteria for the complete integration of systems of differential equations with applications to differential geometry, some aspects of differential forms on Riemannian manifolds related to Sobolev inequalities, Brownian motion on a Cartan-Hadamard manifold, etc.

Two short biographical articles on the works of Sobolev in the 1930s and the foundation of Akademgorodok in Siberia, supplied with unique archive photos of S. Sobolev are included.

This volume presents a selection of survey and research articles based on invited lectures and contributed talks presented at the Workshop on Fluid Dynamics in Porous Media that was held in Coimbra, Portugal, in September 12-14, 2011. The contributions are devoted to mathematical modeling, numerical simulation and their applications, providing the readers a state-of-the-art overview on the latest findings and new challenges on the topic. The book includes research work of worldwide recognized leaders in their respective fields and presents advances in both theory and applications, making it appealing to a vast range of audience, in particular mathematicians, engineers and physicists.

Network Analysis has become a major research topic over the last several years. The broad range of applications that can be described and analyzed by means of a network is bringing together researchers, practitioners and other scientific communities from numerous fields such as Operations Research, Computer Science, Transportation, Energy, Social Sciences, and more. The remarkable diversity of fields that take advantage of Network Analysis makes the endeavor of gathering up-to-date material in a single compilation a useful, yet very difficult, task. The purpose of these proceedings is to overcome this difficulty by collecting the major results found by the participants of the "First International Conference in Network Analysis," held at The University of Florida, Gainesville, USA, from the 14th to the 16th of December 2011. The contributions of this conference not only come from different fields, but also cover a broad range of topics relevant to the theory and practice of network analysis, including the reliability of complex networks, software, theory, methodology and applications.

There are many methods of stable controller design for nonlinear systems. In seeking to go beyond the minimum requirement of stability, Adaptive Dynamic Programming in Discrete Time approaches the challenging topic of optimal control for nonlinear systems using the tools of adaptive dynamic programming (ADP). The range of systems treated is extensive; affine, switched, singularly perturbed and time-delay nonlinear systems are discussed as are the uses of neural networks and techniques of value and policy iteration. The text features three main aspects of ADP in which the methods proposed for stabilization and for tracking and games benefit from the incorporation of optimal control methods: * infinite-horizon control for which the difficulty of solving partial differential Hamilton-Jacobi-Bellman equations directly is overcome, and proof provided that the iterative value function updating sequence converges to the infimum of all the value functions obtained by admissible control law sequences; * finite-horizon control, implemented in discrete-time nonlinear systems showing the reader how to obtain suboptimal control solutions within a fixed number of control steps and with results more easily applied in real systems than those usually gained from infinite-horizon control; * nonlinear games for which a pair of mixed optimal policies are derived for solving games both when the saddle point does not exist, and, when it does, avoiding the existence conditions of the saddle point. Non-zero-sum games are studied in the context of a single network scheme in which policies are obtained guaranteeing system stability and minimizing the individual performance function yielding a Nash equilibrium. In order to make the coverage suitable for the student as well as for the expert reader, Adaptive Dynamic Programming in Discrete Time: * establishes the fundamental theory involved clearly with each chapter devoted to a clearly identifiable control paradigm; * demonstrates convergence proofs of the ADP algorithms to deepen understanding of the derivation of stability and convergence with the iterative computational methods used; and * shows how ADP methods can be put to use both in simulation and in real applications. This text will be of considerable interest to researchers interested in optimal control and its applications in operations research, applied mathematics computational intelligence and engineering. Graduate students working in control and operations research will also find the ideas presented here to be a source of powerful methods for furthering their study.

This book presents a self-contained introduction to the theory of minisum hyperspheres. Thisspecialized researcharea within the larger field ofgeometric optimization is full of interesting and open problems.

This work provides an overview of the history of minisum hyperspheres as well as describes the best techniques for developing and solving minisum hypersphereproblems. Various related areas of geometric and nonlinear optimization are also discussed.

As the first publication devoted to this area of research, this work will be of greatinterest to graduate-level researchersstudyingminisum hypersphere problemsas well asmathematicians interested geometric optimization."

The editors draw on a 3-year project that analyzed a Portuguese area in detail, comparing this study with papers from other regions. Applications include the estimation of technical efficiency in agricultural grazing systems (dairy, beef and mixed) and specifically for dairy farms. The conclusions indicate that it is now necessary to help small dairy farms in order to make them more efficient. These results can be compared with the technical efficiency of a sample of Spanish dairy processing firms presented by Magdalena Kapelko and co-authors.

This volume features key contributions from the International Conference on Pattern Recognition Applications and Methods, (ICPRAM 2012,) held in Vilamoura, Algarve, Portugal from February 6th-8th, 2012. The conference provided a major point of collaboration between researchers, engineers and practitioners in the areas of Pattern Recognition, both from theoretical and applied perspectives, with a focus on mathematical methodologies. Contributions describe applications of pattern recognition techniques to real-world problems, interdisciplinary research, and experimental and theoretical studies which yield new insights that provide key advances in the field. This book will be suitable for scientists and researchers in optimization, numerical methods, computer science, statistics and for differential geometers and mathematical physicists.

Optimization, simulation and control play an increasingly important role in science and industry. Because of their numerous applications in various disciplines, research in these areas is accelerating at a rapid pace. This volume brings together the latest developments in these areas of research as well as presents applications of these results to a wide range of real-world problems. The book is composed of invited contributions by experts from around the world who work to develop and apply new optimization, simulation and control techniques either at a theoretical level or in practice. Some key topics presented include: equilibrium problems, multi-objective optimization, variational inequalities, stochastic processes, numerical analysis, optimization in signal processing, and various other interdisciplinary applications. This volume can serve as a useful resource for researchers, practitioners, and advanced graduate students of mathematics and engineering working in research areas where results in optimization, simulation and control can be applied.

Optimal Control and Optimization of Stochastic Supply Chain Systems examines its subject the context of the presence of a variety of uncertainties. Numerous examples with intuitive illustrations and tables are provided, to demonstrate the structural characteristics of the optimal control policies in various stochastic supply chains and to show how to make use of these characteristics to construct easy-to-operate sub-optimal policies. In Part I, a general introduction to stochastic supply chain systems is provided. Analytical models for various stochastic supply chain systems are formulated and analysed in Part II. In Part III the structural knowledge of the optimal control policies obtained in Part II is utilized to construct easy-to-operate sub-optimal control policies for various stochastic supply chain systems accordingly. Finally, Part IV discusses the optimisation of threshold-type control policies and their robustness. A key feature of the book is its tying together of the complex analytical models produced by the requirements of operational practice, and the simple solutions needed for implementation. The analytical models and theoretical analysis propounded in this monograph will be of benefit to academic researchers and graduate students looking at logistics and supply chain management from standpoints in operations research or industrial, manufacturing, or control engineering. The practical tools and solutions and the qualitative insights into the ideas underlying functional supply chain systems will be of similar use to readers from more industrially-based backgrounds.