Linear Programming


Book Description

This Fourth Edition introduces the latest theory and applications in optimization. It emphasizes constrained optimization, beginning with a substantial treatment of linear programming and then proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. 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, primal-dual simplex method, path-following interior-point method, and homogeneous self-dual methods. In addition, the author provides online JAVA applets that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and JAVA tools can be found on the book's website. The website also includes new online instructional tools and exercises.




Linear Programming 2


Book Description

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.




An Introduction to Linear Programming and Game Theory


Book Description

Praise for the Second Edition: "This is quite a well-done book: very tightly organized, better-than-average exposition, and numerous examples, illustrations, and applications." —Mathematical Reviews of the American Mathematical Society An Introduction to Linear Programming and Game Theory, Third Edition presents a rigorous, yet accessible, introduction to the theoretical concepts and computational techniques of linear programming and game theory. Now with more extensive modeling exercises and detailed integer programming examples, this book uniquely illustrates how mathematics can be used in real-world applications in the social, life, and managerial sciences, providing readers with the opportunity to develop and apply their analytical abilities when solving realistic problems. This Third Edition addresses various new topics and improvements in the field of mathematical programming, and it also presents two software programs, LP Assistant and the Solver add-in for Microsoft Office Excel, for solving linear programming problems. LP Assistant, developed by coauthor Gerard Keough, allows readers to perform the basic steps of the algorithms provided in the book and is freely available via the book's related Web site. The use of the sensitivity analysis report and integer programming algorithm from the Solver add-in for Microsoft Office Excel is introduced so readers can solve the book's linear and integer programming problems. A detailed appendix contains instructions for the use of both applications. Additional features of the Third Edition include: A discussion of sensitivity analysis for the two-variable problem, along with new examples demonstrating integer programming, non-linear programming, and make vs. buy models Revised proofs and a discussion on the relevance and solution of the dual problem A section on developing an example in Data Envelopment Analysis An outline of the proof of John Nash's theorem on the existence of equilibrium strategy pairs for non-cooperative, non-zero-sum games Providing a complete mathematical development of all presented concepts and examples, Introduction to Linear Programming and Game Theory, Third Edition is an ideal text for linear programming and mathematical modeling courses at the upper-undergraduate and graduate levels. It also serves as a valuable reference for professionals who use game theory in business, economics, and management science.




Linear Programming


Book Description

To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming.... Style is informal. ...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study. —Choice Reviews This is a textbook intended for advanced undergraduate or graduate students. It contains both theory and computational practice. —Zentralblatt Math




Theory of Linear and Integer Programming


Book Description

Als Ergänzung zu den mehr praxisorientierten Büchern, die auf dem Gebiet der linearen und Integerprogrammierung bereits erschienen sind, beschreibt dieses Werk die zugrunde liegende Theorie und gibt einen Überblick über wichtige Algorithmen. Der Autor diskutiert auch Anwendungen auf die kombinatorische Optimierung; neben einer ausführlichen Bibliographie finden sich umfangreiche historische Anmerkungen.




Understanding and Using Linear Programming


Book Description

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".




Text Book of Linear Programming-II


Book Description

Linear Programming has progressed a great deal during last two decades. It is becoming increasingly sophisticated with the availability of computer facilities and infusion of new chapters. The text of this book has been presented in easy and simple language. Throughout the text, the two streams theory and technique run side by side. Each technique run side by side. Each technique is preceded by the relevant theory followed by suitable examples. A large number of important problems mostly drawn from university examination papers has been included.




Linear Programming and Its Applications


Book Description

Linear Programming and Its Applications is intended for a first course in linear programming, preferably in the sophomore or junior year of the typical undergraduate curriculum. The emphasis throughout the book is on 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 book arose from lecture notes prepared during the years 1985-1987 while I was a graduate assistant in the Department of Mathematics at The Pennsylvania State University. I used a preliminary draft in a Methods of Management Science class in the spring semester of 1988 at Lock Haven University. Having been extensively tried and tested in the classroom at various stages of its development, the book reflects many modifications either suggested directly by students or deemed appropriate from responses by students in the classroom setting. My primary aim in writing the book was to address common errors and difficulties as clearly and effectively as I could.




Algorithms


Book Description

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text DasGupta also offers a Solutions Manual which is available on the Online Learning Center."Algorithms is an outstanding undergraduate text equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel it is a joy to read." Tim Roughgarden Stanford University