Kategoria BISAC: Mathematics >> Linear & Nonlinear Programming

Advanced Control of Industrial Processes presents the concepts and algorithms of advanced industrial process control and on-line optimisation within the framework of a multilayer structure. Relatively simple unconstrained nonlinear fuzzy control algorithms and linear predictive control laws are covered, as are more involved constrained and nonlinear model predictive control (MPC) algorithms and on-line set-point optimisation techniques.

The major topics and key features are:

- Development and discussion of a multilayer control structure with interrelated direct...

This book consists of five introductory contributions by leading mathematicians on the functional analytic treatment of evolutions equations. In particular the contributions deal with Markov semigroups, maximal L DEGREESp-regularity, optimal control problems for boundary and point control systems, parabolic moving boundary problems and parabolic nonautonomous evolution equations. The book is addressed to PhD students, young researchers and mathematicians doing research in one of the above topics.

In the field of genetic and evolutionary algorithms (GEAs), a large amount of theory and empirical study has been focused on operators and test problems, while problem representation has often been taken as given. This book breaks with this tradition and provides a comprehensive overview on the influence of problem representations on GEA performance. The book summarizes existing knowledge regarding problem representations and describes how basic properties of representations, such as redundancy, scaling, or locality, influence the performance of GEAs and other heuristic optimization...

This volume introduces some basic mathematical models for cell cycle, proliferation, cancer, and cancer therapy. Chapter 1 gives an overview of the modeling of the cell division cycle. Chapter 2 describes how tumor secretes growth factors to form new blood vessels in its vicinity, which provide it with nutrients it needs in order to grow. Chapter 3 explores the process that enables the tumor to invade the neighboring tissue. Chapter 4 models the interaction between a tumor and the immune system. Chapter 5 is concerned with chemotherapy; it uses concepts from control theory to minimize...

Cet ouvrage presente des modeles aleatoires elementaires et certaines de leurs applications courantes: algorithmes d'optimisation, gestion des approvisionnements, dimensionnement de files d'attente, fiabilite et dimensionnement d'ouvrages. Des problematiques plus recentes sont egalement abordees: recherche de sequences exceptionnelles et de zones homogenes de l'ADN, estimation du taux de mutation de l'ADN, phenomenes de coagulation de molecules de polymeres ou d'aerosols."

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature.

This is the first book that presents a...

This book addresses issues associated with the interface of computing, optimisation, econometrics and financial modeling, emphasizing computational optimisation methods and techniques. The first part addresses optimisation problems and decision modeling, plus applications of supply chain and worst-case modeling and advances in methodological aspects of optimisation techniques. The second part covers optimisation heuristics, filtering, signal extraction and time series models. The final part discusses optimisation in portfolio selection and real option modeling.

An in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research...