During the Spring of 1979 one of us (Zionts) was invited to visit Erasmus University in Rotterdam, The Netherlands. It was there that Zionts met another of us (Telgen) who was then in the process of completing a dissertation on redundancy in linear programming. At that time, Telgen proposed an extended visit to Buffalo, during which time he and Zionts would do an extensive study on redundancy. Redundancy, hardly an exciting or new topic, does have numerous applications. Telgen and Zionts planned the project for the Summer of 1980, and enlisted the support of all the contributors as well as the other two members of our team (Karwan and Lotfi). Lotfi was then a Ph. D. student in Industrial Engineering searching for a thesis topic. Redundancy became his topic. Karwan and Zionts served as his thesis co-chairmen, with Telgen serving as an outside reader of the thesis. We initially had hoped to complete the study during Telgen's stay in Buffalo, but that was far too optimistic. Lotfi completed his dissertation during the late Spring-early Summer of 1981. As the project took shape, we decided that we had more than enough for an article, or even several articles. Accordingly, not wanting to produce redundant papers, we decided to produce this volume --- a state-of-the-art review of methods for handling redundancy and comprehensive tests of the various methods, together with extensions and further developments of the most promising methods.
This edited book presents recent developments and state-of-the-art review in various areas of mathematical programming and game theory. It is a peer-reviewed research monograph under the ISI Platinum Jubilee Series on Statistical Science and Interdisciplinary Research. This volume provides a panoramic view of theory and the applications of the methods of mathematical programming to problems in statistics, finance, games and electrical networks. It also provides an important as well as timely overview of research trends and focuses on the exciting areas like support vector machines, bilevel programming, interior point method for convex quadratic programming, cooperative games, non-cooperative games and stochastic games. Researchers, professionals and advanced graduates will find the book an essential resource for current work in mathematical programming, game theory and their applications. Sample Chapter(s). Foreword (45 KB). Chapter 1: Mathematical Programming and its Applications in Finance (177 KB). Contents: Mathematical Programming and Its Applications in Finance (L C Thomas); Anti-Stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix (S N Kabadi & A P Punnen); A New Practically Efficient Interior Point Method for Convex Quadratic Programming (K G Murty); A General Framework for the Analysis of Sets of Constraints (R Caron & T Traynor), Tolerance-Based Algorithms for the Traveling Salesman Problem (D Ghosh et al.); On the Membership Problem of the Pedigree Polytope (T S Arthanari); Exact Algorithms for a One-Defective Vertex Colouring Problem (N Achuthan et al.); Complementarity Problem Involving a Vertical Block Matrix and Its Solution Using Neural Network Model (S K Neogy et al.); Fuzzy Twin Support Vector Machines for Pattern Classification (R Khemchandani et al.); An Overview of the Minimum Sum of Absolute Errors Regression (S C Narula & J F Wellington); Hedging Against the Market with No Short Selling (S A Clark & C Srinivasan); Mathematical Programming and Electrical Network Analysis II: Computational Linear Algebra Through Network Analysis (H Narayanan); Dynamic Optimal Control Policy in Price and Quality for High Technology Product (A K Bardhan & U Chanda); Forecasting for Supply Chain and Portfolio Management (K G Murty); Variational Analysis in Bilevel Programming (S Dempe et al.); Game Engineering (R J Aumann); Games of Connectivity (P Dubey & R Garg); A Robust Feedback Nash Equilibrium in a Climate Change Policy Game (M Hennlock); De Facto Delegation and Proposer Rules (H Imai & K Yonezaki); The Bargaining Set in Effectivity Function (D Razafimahatolotra); Dynamic Oligopoly as a Mixed Large Game OCo Toy Market (A Wiszniewska-Matyszkiel); On Some Classes of Balanced Games (R B Bapat); Market Equilibrium for Combinatorial Auctions and the Matching Core of Nonnegative TU Games (S Lahiri); Continuity, Manifolds, and Arrow''s Social Choice Problem (K Saukkonen); On a Mixture Class of Stochastic Games with Ordered Field Property (S K Neogy). Readership: Researchers, professionals and advanced students in mathematical programming, game theory, management sciences and computational mathematics.
This work is concerned with theoretical developments in the area of mathematical programming, development of new algorithms and software and their applications in science and industry. It aims to expose recent mathematical developments to a larger audience in science and industry.
The 5th edition of Model Building in Mathematical Programmingdiscusses the general principles of model building in mathematicalprogramming and demonstrates how they can be applied by usingseveral simplified but practical problems from widely differentcontexts. Suggested formulations and solutions are given togetherwith some computational experience to give the reader a feel forthe computational difficulty of solving that particular type ofmodel. Furthermore, this book illustrates the scope and limitationsof mathematical programming, and shows how it can be applied toreal situations. By emphasizing the importance of the building andinterpreting of models rather than the solution process, the authorattempts to fill a gap left by the many works which concentrate onthe algorithmic side of the subject. In this article, H.P. Williams explains his originalmotivation and objectives in writing the book, how it has beenmodified and updated over the years, what is new in this editionand why it has maintained its relevance and popularity over theyears: ahref="http://www.statisticsviews.com/details/feature/4566481/Model-Building-in-Mathematical-Programming-published-in-fifth-edition.html"http://www.statisticsviews.com/details/feature/4566481/Model-Building-in-Mathematical-Programming-published-in-fifth-edition.html/a
In their review of the "Bayesian analysis of simultaneous equation systems", Dr~ze and Richard (1983) - hereafter DR - express the following viewpoint about the present state of development of the Bayesian full information analysis of such sys tems i) the method allows "a flexible specification of the prior density, including well defined noninformative prior measures"; ii) it yields "exact finite sample posterior and predictive densities". However, they call for further developments so that these densities can be eval uated through 'numerical methods, using an integrated software packa~e. To that end, they recommend the use of a Monte Carlo technique, since van Dijk and Kloek (1980) have demonstrated that "the integrations can be done and how they are done". In this monograph, we explain how we contribute to achieve the developments suggested by Dr~ze and Richard. A basic idea is to use known properties of the porterior density of the param eters of the structural form to design the importance functions, i. e. approximations of the posterior density, that are needed for organizing the integrations.
Optimal Reliability Design provides a detailed introduction to systems reliability and reliability optimization. State-of-the-art techniques for maximizing system reliability are described, focusing on component reliability enhancement and redundancy arrangement. The authors present several case studies and show how optimization techniques are applied in practice. They also pay particular attention to finding methods that give the optimal trade-off between reliability and cost. The book is suitable for use on graduate-level courses in reliability engineering and operations research. It will also be a valuable reference for practising engineers.
Welcome to ANALYZE, designed to provide computer assistance for analyzing linear programs and their solutions. Chapter 1 gives an overview of ANALYZE and how to install it. It also describes how to get started and how to obtain further documentation and help on-line. Chapter 2 reviews the forms of linear programming models and describes the syntax of a model. One of the routine, but important, functions of ANALYZE is to enable convenient access to rows and columns in the matrix by conditional delineation. Chapter 3 illustrates simple queries, like DISPLAY, LIST, and PICTURE. This chapter also introduces the SUBMAT command level to define any submatrix by an arbitrary sequence of additions, deletions and reversals. Syntactic explanations and a schema view are also illustrated. Chapter 4 goes through some elementary exercises to demonstrate computer assisted analysis and introduce additional conventions of the ANALYZE language. Besides simple queries, it demonstrates the INTERPRT command, which automates the analysis process and gives English explanations of results. The last 2 exercises are diagnoses of elementary infeasible instances of a particular model. Chapter 5 progresses to some advanced uses of ANALYZE. The first is blocking to obtain macro views of the model and for finding embedded substructures, like a netform. The second is showing rates of substitution described by the basic equations. Then, the use of the REDUCE and BASIS commands are illustrated for a variety of applications, including solution analysis, infeasibility diagnosis, and redundancy detection.
