
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of manage ment, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in some combinatorial theory as well. The chapters on duality, and on flow in networks, are particularly directed towards this aim and they contain theorems which might not be directly relevant to methods of computation. The application of the concept of duality to the theory of games is of historical interest. It is hoped that the figures, which illustrate the results, will be found illuminating by readers with active geometrical imagination.
This text introduces readers to the wide-ranging applicability of linear programming, focusing on numerical algorithms and their underlying theory. The book is based on approximately 16 hours of lectures for students of mathematics, statistics, and operational research, aiming to cover problems in management, administration, transportation, and other areas. Emphasis is placed on numerical algorithms illustrated with small examples solvable by hand, though these methods are also applicable to larger problems via computers. The author believes users of these algorithms should understand the theory, thus addressing both practitioners and mathematicians interested in algebraic and combinatorial theory.
The book is presented as a foundational text for students and practitioners of linear programming, emphasizing both numerical algorithms and theoretical underpinnings. Its approach, using small examples for manual computation and explaining the theory behind widely used computer packages, suggests it aims for a solid understanding of the subject. The inclusion of topics like duality and network flow, along with their theoretical implications, indicates a depth that appeals to those interested in the mathematical aspects of optimization.
Page Count:
160
Publication Date:
1981-05-21
Publisher:
3Island Press
ISBN-10:
940116925X
ISBN-13:
9789401169257
No comments yet. Be the first to share your thoughts!