Along with the traditional material concerning linear programming (the simplex method, the theory of duality, the dual simplex method), In-Depth Analysis of Linear Programming contains new results of research carried out by the authors. For the first time, the criteria of stability (in the geometrical and algebraic forms) of the general linear programming problem are formulated and proved. New regularization methods based on the idea of extension of an admissible set are proposed for solving unstable (ill-posed) linear programming problems. In contrast to the well-known regularization methods, in the methods proposed in this book the initial unstable problem is replaced by a new stable auxiliary problem. This is also a linear programming problem, which can be solved by standard finite methods. In addition, the authors indicate the conditions imposed on the parameters of the auxiliary problem which guarantee its stability, and this circumstance advantageously distinguishes the regularization methods proposed in this book from the existing methods. In these existing methods, the stability of the auxiliary problem is usually only presupposed but is not explicitly investigated. In this book, the traditional material contained in the first three chapters is expounded in much simpler terms than in the majority of books on linear programming, which makes it accessible to beginners as well as those more familiar with the area.

This monograph presents a collection of results, observations, and examples related to dynamical systems described by linear and nonlinear ordinary differential and difference equations. In particular, dynamical systems that are susceptible to analysis by the Liapunov approach are considered. The naive observation that certain "diagonal-type" Liapunov functions are ubiquitous in the literature attracted the attention of the authors and led to some natural questions. Why does this happen so often? What are the spe cial virtues of these functions in this context? Do they occur so frequently merely because they belong to the simplest class of Liapunov functions and are thus more convenient, or are there any more specific reasons? This monograph constitutes the authors' synthesis of the work on this subject that has been jointly developed by them, among others, producing and compiling results, properties, and examples for many years, aiming to answer these questions and also to formalize some of the folklore or "cul ture" that has grown around diagonal stability and diagonal-type Liapunov functions. A natural answer to these questions would be that the use of diagonal type Liapunov functions is frequent because of their simplicity within the class of all possible Liapunov functions. This monograph shows that, although this obvious interpretation is often adequate, there are many in stances in which the Liapunov approach is best taken advantage of using diagonal-type Liapunov functions. In fact, they yield necessary and suffi cient stability conditions for some classes of nonlinear dynamical systems."

In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.

The chapters in this volume, written by international experts from different fields of mathematics, are devoted to honoring George Isac, a renowned mathematician. These contributions focus on recent developments in complementarity theory, variational principles, stability theory of functional equations, nonsmooth optimization, and several other important topics at the forefront of nonlinear analysis and optimization.

Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

Semi-infinite optimization is a vivid field of active research. Recently semi infinite optimization in a general form has attracted a lot of attention, not only because of its surprising structural aspects, but also due to the large number of applications which can be formulated as general semi-infinite programs. The aim of this book is to highlight structural aspects of general semi-infinite programming, to formulate optimality conditions which take this structure into account, and to give a conceptually new solution method. In fact, under certain assumptions general semi-infinite programs can be solved efficiently when their bi-Ievel structure is exploited appropriately. After a brief introduction with some historical background in Chapter 1 we be gin our presentation by a motivation for the appearance of standard and general semi-infinite optimization problems in applications. Chapter 2 lists a number of problems from engineering and economics which give rise to semi-infinite models, including (reverse) Chebyshev approximation, minimax problems, ro bust optimization, design centering, defect minimization problems for operator equations, and disjunctive programming."

Complementarity theory is a new domain in applied mathematics and is concerned with the study of complementarity problems. These problems represent a wide class of mathematical models related to optimization, game theory, economic engineering, mechanics, fluid mechanics, stochastic optimal control etc. The book is dedicated to the study of nonlinear complementarity problems by topological methods. Audience: Mathematicians, engineers, economists, specialists working in operations research and anybody interested in applied mathematics or in mathematical modeling.

Most books about global optimization describe the theory of thealgorithms, whereas a given implementation's quality never dependsexclusively on the theoretical soundness of the algorithms that areimplemented. The literature rarely discusses the tuning of algorithmicparameters, implementation tricks, software architectures, and theembedding of local solvers within global solvers. And yet, there aremany good software implementations out there from which the entirecommunity could learn something. The scope of this book is moving afew steps toward the systematization of the path that goes from theinvention to the implementation and testing of a global optimizationalgorithm.

Linear Programming provides an in-depth look at simplex based as well as the more recent interior point techniques for solving linear programming problems. Starting with a review of the mathematical underpinnings of these approaches, the text provides details of the primal and dual simplex methods with the primal-dual, composite, and steepest edge simplex algorithms. This then is followed by a discussion of interior point techniques, including projective and affine potential reduction, primal and dual affine scaling, and path following algorithms. Also covered is the theory and solution of the linear complementarity problem using both the complementary pivot algorithm and interior point routines. A feature of the book is its early and extensive development and use of duality theory. Audience: The book is written for students in the areas of mathematics, economics, engineering and management science, and professionals who need a sound foundation in the important and dynamic discipline of linear programming.

Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research in particular in algorithms, computational complexity, distributed computing and optimization are vital to modern services such as mobile telephony, online banking and VoIP.

This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.

The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics."

Optimization is presented in most multivariable calculus courses as an application of the gradient, and while this treatment makes sense for a calculus course, there is much more to the theory of optimization. Optimization problems are generated constantly, and the theory of optimization has grown and developed in response to the challenges presented by these problems. This textbook aims to show readers how optimization is done in practice and help them to develop an appreciation for the richness of the theory behind the practice. Exercises, problems (including modeling and computational problems), and implementations are incorporated throughout the text to help students learn by doing. Python notes are inserted strategically to help readers complete computational problems and implementations. The Basics of Practical Optimization, Second Edition is intended for undergraduates who have completed multivariable calculus, as well as anyone interested in optimization. The book is appropriate for a course that complements or replaces a standard linear programming course.

Continuous-time Markov decision processes (MDPs), also known as controlled Markov chains, are used for modeling decision-making problems that arise in operations research (for instance, inventory, manufacturing, and queueing systems), computer science, communications engineering, control of populations (such as fisheries and epidemics), and management science, among many other fields. This volume provides a unified, systematic, self-contained presentation of recent developments on the theory and applications of continuous-time MDPs. The MDPs in this volume include most of the cases that arise in applications, because they allow unbounded transition and reward/cost rates. Much of the material appears for the first time in book form.

Nonconvex Optimization is a multi-disciplinary research field that deals with the characterization and computation of local/global minima/maxima of nonlinear, nonconvex, nonsmooth, discrete and continuous functions. Nonconvex optimization problems are frequently encountered in modeling real world systems for a very broad range of applications including engineering, mathematical economics, management science, financial engineering, and social science. This contributed volume consists of selected contributions from the Advanced Training Programme on Nonconvex Optimization and Its Applications held at Banaras Hindu University in March 2009. It aims to bring together new concepts, theoretical developments, and applications from these researchers. Both theoretical and applied articles are contained in this volume which adds to the state of the art research in this field. Topics in Nonconvex Optimization is suitable for advanced graduate students and researchers in this area.

The book provides a broad introduction to both the theory and the application of optimization with a special emphasis on the elegance, importance, and usefulness of the parametric self-dual simplex method. The book assumes that a problem in "standard form," is a problem with inequality constraints and nonnegative variables. The main new innovation to the book is the use of clickable links to the (newly updated) online app to help students do the trivial but tedious arithmetic when solving optimization problems. The latest edition now includes: a discussion of modern Machine Learning applications, as motivational material; a section explaining Gomory Cuts and an application of integer programming to solve Sudoku problems. Readers will discover a host of practical business applications as well as non-business applications. Topics are clearly developed with many numerical examples worked out in detail. Specific examples and concrete algorithms precede more abstract topics. With its focus on solving practical problems, the book features free C programs to implement the major algorithms covered, including the two-phase simplex method, the primal-dual simplex method, the path-following interior-point method, and and the homogeneous self-dual method. In addition, the author provides online tools that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and online pivot tools can be found on the book's website. The website also includes new online instructional tools and exercises.

The customer orientation philosophy of modern business organizations and the implementation of the main principles of continuous improvement, justifies the importance of evaluating and analyzing cust omer satisfaction. In fact, customer satisfaction isconsidere d today as a baseline standard of performance and a possi ble standardo f excellence forany business organization. Extensive research has defined several alternative approaches, which examine the customer satisfaction evaluation prob lem from very different perspectives. These approaches include simple quantitative tools, statistical and data analysis techniques, consumer behavioral models, etc. and adopt the following main prin ciples: * The data of the problem are based on th e customers' judgments and are directly collected from them. * This is a multivariate evaluation problem given that customer's overall satisfac tion depends on a setof variables representing product/service characteristic dimensions. * Usually, an additive formula is used in order to aggregate partial evaluations in ano verall satisfaction measure. Many of the aforementioned approaches don ot consider the qualitative form of customers' judgments, although this information constitutes the main satisfaction input data. Furthermore, insev eral cases , the measurements are not sufficient enough to analyze in detail customer sa tisfaction because models' results are mainly focused on a simple descriptive analysis.

The first comprehensive account of the theory of mass transportation problems and its applications. In Volume I, the authors systematically develop the theory with emphasis on the Monge-Kantorovich mass transportation and the Kantorovich-Rubinstein mass transshipment problems. They then discuss a variety of different approaches towards solving these problems and exploit the rich interrelations to several mathematical sciences - from functional analysis to probability theory and mathematical economics. The second volume is devoted to applications of the above problems to topics in applied probability, theory of moments and distributions with given marginals, queuing theory, risk theory of probability metrics and its applications to various fields, among them general limit theorems for Gaussian and non-Gaussian limiting laws, stochastic differential equations and algorithms, and rounding problems. Useful to graduates and researchers in theoretical and applied probability, operations research, computer science, and mathematical economics, the prerequisites for this book are graduate level probability theory and real and functional analysis.

Classical probability theory provides information about random walks after a fixed number of steps. For applications, however, it is more natural to consider random walks evaluated after a random number of steps. Examples are sequential analysis, queuing theory, storage and inventory theory, insurance risk theory, reliability theory, and the theory of contours. Stopped Random Walks: Limit Theorems and Applications shows how this theory can be used to prove limit theorems for renewal counting processes, first passage time processes, and certain two-dimenstional random walks, and to how these results are useful in various applications.

This second edition offers updated content and an outlook on further results, extensions and generalizations. A new chapter examines nonlinear renewal processes in order to present the analagous theory for perturbed random walks, modeled as a random walk plus "noise."

This addition to the ISOR series introduces complementarity models in a straightforward and approachable manner and uses them to carry out an in-depth analysis of energy markets, including formulation issues and solution techniques. In a nutshell, complementarity models generalize: a. optimization problems via their Karush-Kuhn-Tucker conditions b. on-cooperative games in which each player may be solving a separate but related optimization problem with potentially overall system constraints (e.g., market-clearing conditions) c. conomic and engineering problems that aren't specifically derived from optimization problems (e.g., spatial price equilibria) d. roblems in which both primal and dual variables (prices) appear in the original formulation (e.g., The National Energy Modeling System (NEMS) or its precursor, PIES). As such, complementarity models are a very general and flexible modeling format. A natural question is why concentrate on energy markets for this complementarity approach? s it turns out, energy or other markets that have game theoretic aspects are best modeled by complementarity problems. The reason is that the traditional perfect competition approach no longer applies due to deregulation and restructuring of these markets and thus the corresponding optimization problems may no longer hold. Also, in some instances it is important in the original model formulation to involve both primal variables (e.g., production) as well as dual variables (e.g., market prices) for public and private sector energy planning. Traditional optimization problems can not directly handle this mixing of primal and dual variables but complementarity models can and this makes them all that more effective for decision-makers.

Linear Programming (LP) is perhaps the most frequently used optimization technique. One of the reasons for its wide use is that very powerful solution algorithms exist for linear optimization. Computer programs based on either the simplex or interior point methods are capable of solving very large-scale problems with high reliability and within reasonable time. Model builders are aware of this and often try to formulate real-life problems within this framework to ensure they can be solved efficiently. It is also true that many real-life optimization problems can be formulated as truly linear models and also many others can well be approximated by linearization. The two main methods for solving LP problems are the variants of the simplex method and the interior point methods (IPMs). It turns out that both variants have their role in solving different problems. It has been recognized that, since the introduction of the IPMs, the efficiency of simplex based solvers has increased by two orders of magnitude. This increased efficiency can be attributed to the following: (1) theoretical developments in the underlying algorithms, (2) inclusion of results of computer science, (3) using the principles of software engineering, and (4) taking into account the state-of-the-art in computer technology.
Theoretically correct algorithms can be implemented in many different ways, but the performance is dependent on how the implementation is done. The success is based on the proper synthesis of the above mentioned (1-4) components. Computational Techniques of the Simplex Method is a systematic treatment focused on the computational issues of the simplex method. It provides a comprehensive coverage of the most important and successful algorithmic and implementation techniques of the simplex method. It is a unique source of essential, never discussed details of algorithmic elements and their implementation. On the basis of the book the reader will be able to create a highly advanced implementation of the simplex method which, in turn, can be used directly or as a building block in other solution algorithms.

This book offers a comprehensive treatment of linear programming as well as of the optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces. An introduction surveying fifty years of linear optimization is given. The book can serve both as a graduate textbook for linear programming and as a text for advanced topics classes or seminars. Exercises as well as several case studies are included. The book is based on the author's long term experience in teaching and research. For his research work he has received, among other honors, the 1983 Lanchester Prize of the Operations Research Society of America, the 1985 Dantzig Prize of the Mathematical Programming Society and the Society for Industrial Applied Mathematics and a 1989 Alexander-von-Humboldt Senior U.S. Scientist Research Award.

Encompassing all the major topics students will encounter in courses on the subject, the authors teach both the underlying mathematical foundations and how these ideas are implemented in practice. They illustrate all the concepts with both worked examples and plenty of exercises, and, in addition, provide software so that students can try out numerical methods and so hone their skills in interpreting the results. As a result, this will make an ideal textbook for all those coming to the subject for the first time. Authors' note: A problem recently found with the software is due to a bug in Formula One, the third party commercial software package that was used for the development of the interface. It occurs when the date, currency, etc. format is set to a non-United States version. Please try setting your computer date/currency option to the United States option . The new version of Formula One, when ready, will be posted on WWW.

Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than heretofore, and the important duality theorem becomes almost obvious. Examples and extensive discussions throughout the book provide insight into definitions, theorems, and applications. There is considerable informal discussion on how best to play matrix games. The book is designed for a one-semester undergraduate course. Readers will need a degree of mathematical sophistication and general tools such as sets, functions, and summation notation. No single college course is a prerequisite, but most students will do better with some prior college mathematics. This thorough introduction to linear programming and game theory will impart a deep understanding of the material and also increase the student's mathematical maturity.

This book gives a gentle but up-to-date introduction into the theory of operator semigroups (or linear dynamical systems), which can be used with great success to describe the dynamics of complicated phenomena arising in many applications. Positivity is a property which naturally appears in physical, chemical, biological or economic processes. It adds a beautiful and far reaching mathematical structure to the dynamical systems and operators describing these processes. In the first part, the finite dimensional theory in a coordinate-free way is developed, which is difficult to find in literature. This is a good opportunity to present the main ideas of the Perron-Frobenius theory in a way which can be used in the infinite dimensional situation. Applications to graph matrices, age structured population models and economic models are discussed. The infinite dimensional theory of positive operator semigroups with their spectral and asymptotic theory is developed in the second part. Recent applications illustrate the theory, like population equations, neutron transport theory, delay equations or flows in networks. Each chapter is accompanied by a large set of exercises. An up-to-date bibliography and a detailed subject index help the interested reader. The book is intended primarily for graduate and master students. The finite dimensional part, however, can be followed by an advanced bachelor with a solid knowledge of linear algebra and calculus.

The effectiveness of the algorithms of linear programming in solving problems is largely dependent upon the particular applications from which these problems arise. A first course in linear programming should not only allow one to solve many different types of problems in many different contexts but should provide deeper insights into the fields in which linear programming finds its utility. To this end, the emphasis throughtout Linear Programming and Its Applications is on the acquisition of linear programming skills via the algorithmic solution of small-scale problems both in the general sense and in the specific applications where these problems naturally occur. The first part of the book deals with methods to solve general linear programming problems and discusses the theory of duality which connects these problems. The second part of the book deals with linear programming in different applications including the fields of game theory and graph theory as well as the more traditional transportation and assignment problems. The book is versatile; in as much as Linear Programming and Its Applications is intended to be used as a first course in linear programming, it is suitable for students in such varying fields as mathematics, computer science, engineering, actuarial science, and economics.

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming explains in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems. The second edition also includes information on the remarkable progress in the development of mixed integer programming solvers in the 22 years since the first edition of the book appeared. The updated text includes information on the most recent developments in the field such as the much improved preprocessing/presolving and the many new ideas for primal heuristics included in the solvers. The result has been a speed-up of several orders of magnitude. The other major change reflected in the text is the widespread use of decomposition algorithms, in particular column generation (branch-(cut)-and-price) and Benders' decomposition. The revised second edition: Contains new developments on column generation Offers a new chapter on Benders' algorithm Includes expanded information on preprocessing, heuristics, and branch-and-cut Presents several basic and extended formulations, for example for fixed cost network flows Also touches on and briefly introduces topics such as non-bipartite matching, the complexity of extended formulations or a good linear program for the implementation of lift-and-project Written for students of integer/mathematical programming in operations research, mathematics, engineering, or computer science, Integer Programming offers an updated edition of the basic text that reflects the most recent developments in the field.