You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
"This comprehensive treatment of the fundamental ideas and principles of linear programming covers basic theory, selected applications, network flow problems, and advanced techniques. Using specific examples to illuminate practical and theoretical aspects of the subject, the author clearly reveals the structures of fully detailed proofs. The presentation is geared toward modern efficient implementations of the simplex method and appropriate data structures for network flow problems. Completely self-contained, it develops even elementary facts on linear equations and matrices from the beginning."--Back cover.
Designed primarily for economists and those interested in management economics who are not necessarily accomplished mathematicians, this text offers a clear, concise exposition of the relationship of linear programming to standard economic analysis. The research and writing were supported by The RAND Corporation in the late 1950s. Linear programming has been one of the most important postwar developments in economic theory, but until publication of the present volume, no text offered a comprehensive treatment of the many facets of the relationship of linear programming to traditional economic theory. This book was the first to provide a wide-ranging survey of such important aspects of the to...
The book is an introductory textbook mainly for students of computer science and mathematics. Our guiding phrase is "what every theoretical computer scientist should know about linear programming". A major focus is on applications of linear programming, both in practice and in theory. The book is concise, but at the same time, the main results are covered with complete proofs and in sufficient detail, ready for presentation in class. The book does not require more prerequisites than basic linear algebra, which is summarized in an appendix. One of its main goals is to help the reader to see linear programming "behind the scenes".
George Dantzig is widely regarded as the founder of this subject with his invention of the simplex algorithm in the 1940's. In this second volume, the theory of the items discussed in the first volume is expanded to include such additional advanced topics as variants of the simplex method; interior point methods, GUB, decomposition, integer programming, and game theory. Graduate students in the fields of operations research, industrial engineering and applied mathematics will thus find this volume of particular interest.
Linear Programming is a well-written introduction to the techniques and applications of linear programming. It clearly shows readers how to model, solve, and interpret appropriate linear programming problems. Feiring has presented several carefully-chosen examples which provide a foundation for mathematical modelling and demonstrate the wide scope of the techniques. He subsequently develops an understanding of the Simplex Method and Sensitivity Analysis and includes a discussion of computer codes for linear programming. This book should encourage the spread of linear programming techniques throughout the social sciences and, since it has been developed from Feiring's own class notes, it is ideal for students, particularly those with a limited background in quantitative methods.
In real-world problems related to finance, business, and management, mathematicians and economists frequently encounter optimization problems. In this classic book, George Dantzig looks at a wealth of examples and develops linear programming methods for their solutions. He begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them. Treatments of the price concept, the transportation problem, and matrix methods are also given, and key mathematical concepts such as the properties of convex sets and linear vector spaces are covered. George Dantzig is properly acclaimed as the "father of linear programming." Linear programming is a ...
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.
This book provides an introduction to optimization. It details constrained optimization, beginning with a substantial treatment of linear programming and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Coverage underscores the purpose of optimization: to solve practical problems on a computer. C programs that implement the major algorithms and JAVA tools are available online.
Linear programming finds the least expensive way to meet given needs with available resources. Its results are used in every area of engineering and commerce: agriculture, oil refining, banking, and air transport. Authors Kolman and Beck present the basic notions of linear programming and illustrate how they are used to solve important common problems. The software on the included disk leads students step-by-step through the calculations. The Second Edition is completely revised and provides additional review material on linear algebra as well as complete coverage of elementary linear programming. Other topics covered include: the Duality Theorem; transportation problems; the assignment prob...
Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, ma...