Numerical Methods for Linear Control Systems Design and Analysis is an interdisciplinary textbook aimed at systematic descriptions and implementations of numerically-viable algorithms based on well-established, efficient and stable modern numerical linear techniques for mathematical problems arising in the design and analysis of linear control systems both for the first- and second-order models. - Unique coverage of modern mathematical concepts such as parallel computations, second-order systems, and large-scale solutions - Background material in linear algebra, numerical linear algebra, and control theory included in text - Step-by-step explanations of the algorithms and examples

................................................................. The performance of a nonlinear programming algorithm can only be ascertained by numerical experiments requiring the collection and implementation of test examples in dependence upon the desired performance criterium. This book should be considered as an assis tance for a test designer since it presents an extensive collec tion of nonlinear programming problems which have been used in the past to test or compare optimization programs. He will be in formed about the optimal solution, about the structure of the problem in the neighbourhood of the solution, and, in addition, about the usage of the corresp,onding FORTRAN subroutines if he is interested in obtaining them -ofi a magnetic tape. Chapter I shows how the test examples are documented. In par ticular, the evaluation of computable information about the solu tion of a problem is outlined. It is explained how the optimal solution, the optimal Lagrange-multipliers, and the condition number of the projected Hessian of the Lagrangian are obtained. Furthermore, a classification number is defined allowing a formal description of a test problem, and the documentation scheme is described which is used in Chapter IV to present the problems.

The disjunctive cut principle of Balas and Jeroslow, and the related polyhedral annexation principle of Glover, provide new insights into cutting plane theory. This has resulted in its ability to not only subsume many known valid cuts but also improve upon them. Originally a set of notes were written for the purpose of putting together in a common terminology and framework significant results of Glover and others using a geometric approach, referred to in the literature as convexity cuts, and the algebraic approach of Balas and Jeroslow known as Disjunctive cuts. As it turned out subsequently the polyhedral annexation approach of Glover is also closely connected with the basic disjunctive principle of Balas and Jeroslow. In this monograph we have included these results and have also added several published results which seem to be of strong interest to researchers in the area of developing strong cuts for disjunctive programs. In particular, several results due to Balas [4,5,6,7], Glover [18,19] and Jeroslow [23,25,26] have been used in this monograph. The appropriate theorems are given without proof. The notes also include several results yet to be published [32,34,35] obtained under a research contract with the National Science Foundation to investigate solution methods for disjunctive programs. The monograph is self-contained and complete in the sense that it attempts to pool together existing results which the authors viewed as important to future research on optimization using the disjunctive cut approach.

The theory of optimal decisions in a stochastic environment has seen many new developments in recent years. The implications of such theory for empirical and policy applications are several. This book attempts to analyze some of the impor tant applied aspects of this theory and its recent developments. The stochastic environment is considered here in specific form, e.g., (a) linear programs (LP) with parameters subject to a probabilistic mechanism, (b) decision models with risk aversion, (c) resource allocation in a team, and (d) national economic planning. The book attempts to provide new research insights into several areas, e.g., (a) mixed strategy solutions and econometric tests of hypotheses of LP models, (b) the dual problems of efficient estimation and optimal regulation, (c) input-output planning under imperfect competition, and (d) linear programs viewed as constrained statistical games. Methods of optimal decision rules developed here for quadratic and linear decision problems are applicable in three broad areas: (a) applied economic models in resource allocation, planning and team decision, (b) operations research models in management decisions involving portfolio analysis and stochastic programming, and (c) systems science models in stochastic control and adaptive behavior. Some results reported here have been published in professional journals be-. fore, and I would like to thank the following journals in particular: Inter national Journal of Systems Science, Journal of Optimization Theory and Applica tions and Journal of Mathematical Analysis and Applications.

The interest in the mathematical modeling of transportation systems stems from the need to predict how people might make use of new or improved transport infrastruc ture in order to evaluate the benefit of the required investments. To this end it is necessary to build models of the demand for transportation and models that de termine the way in which people who travel use the transportation network. If such models may be constructed and their validity reasonably assured, then the predic tion of the traffic flows on future and present transportation links may be carried out by simulating future situations and then evaluating the potential benefits of alternative improvement projects. In the attempts that were made to construct mathematical models of transportation networks, the notion of equilibrium plays a central role. Suppose that the demand for transportation, that is, the number of trips that occur between the - rious origins and destinations is known. Then it is necessary to determine how these trips are attracted to the alternative routes available between origins and destinations. Knight (1924), gave a simple and intuitively clear description of the behaviour of road traffic under conditions of congestion.