Feasibility And Infeasibility In Optimization

Written by a world leader in the field and aimed at researchers in applied and engineering sciences, this brilliant text has as its main goal imparting an understanding of the methods so that practitioners can make immediate use of existing algorithms and software, and so that researchers can extend the state of the art and find new applications. It includes algorithms on seeking feasibility and analyzing infeasibility, as well as describing new and surprising applications.

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.

Assuming only basic linear algebra, this textbook is the perfect starting point for undergraduate students from across the mathematical sciences.

This book constitutes the proceedings of the 12th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2015, held in Barcelona, Spain, in May 2015. The 29 papers presented together with 8 short papers in this volume were carefully reviewed and selected from 90 submissions. The purpose of the conference series is to bring together researchers in the fields of Constraint Programming, Artificial Intelligence and Operations Research to explore ways of solving hard and large scale combinatorial optimization problems that emerge in various industrial domains. Pooling the skills and strengths of this diverse group of researchers has proved extremely effective and valuable during the past decade leading to improvements and cross-fertilization between the three fields as well as breakthrough for actual applications.

Optimization models play an increasingly important role in financial decisions. This is the first textbook devoted to explaining how recent advances in optimization models, methods and software can be applied to solve problems in computational finance more efficiently and accurately. Chapters discussing the theory and efficient solution methods for all major classes of optimization problems alternate with chapters illustrating their use in modeling problems of mathematical finance. The reader is guided through topics such as volatility estimation, portfolio optimization problems and constructing an index fund, using techniques such as nonlinear optimization models, quadratic programming formulations and integer programming models respectively. The book is based on Master's courses in financial engineering and comes with worked examples, exercises and case studies. It will be welcomed by applied mathematicians, operational researchers and others who work in mathematical and computational finance and who are seeking a text for self-learning or for use with courses.

The AIMMS Optimization Modeling book provides not only an introduction to modeling but also a suite of worked examples. It is aimed at users who are new to modeling and those who have limited modeling experience. Both the basic concepts of optimization modeling and more advanced modeling techniques are discussed. The Optimization Modeling book is AIMMS version independent.

The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics being

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.