Author: Jiri Matousek Publisher: Springer Science & Business Media ISBN: 3540307176 Category : Mathematics Languages : en Pages : 230
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".
Author: Paul R. Thie Publisher: John Wiley & Sons ISBN: 1118165454 Category : Mathematics Languages : en Pages : 476
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.
Author: Alexander Schrijver Publisher: John Wiley & Sons ISBN: 9780471982326 Category : Mathematics Languages : en Pages : 488
Book Description
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, mathematics and computer science. It will also be of interest to mathematical historians. Contents 1 Introduction and preliminaries; 2 Problems, algorithms, and complexity; 3 Linear algebra and complexity; 4 Theory of lattices and linear diophantine equations; 5 Algorithms for linear diophantine equations; 6 Diophantine approximation and basis reduction; 7 Fundamental concepts and results on polyhedra, linear inequalities, and linear programming; 8 The structure of polyhedra; 9 Polarity, and blocking and anti-blocking polyhedra; 10 Sizes and the theoretical complexity of linear inequalities and linear programming; 11 The simplex method; 12 Primal-dual, elimination, and relaxation methods; 13 Khachiyan's method for linear programming; 14 The ellipsoid method for polyhedra more generally; 15 Further polynomiality results in linear programming; 16 Introduction to integer linear programming; 17 Estimates in integer linear programming; 18 The complexity of integer linear programming; 19 Totally unimodular matrices: fundamental properties and examples; 20 Recognizing total unimodularity; 21 Further theory related to total unimodularity; 22 Integral polyhedra and total dual integrality; 23 Cutting planes; 24 Further methods in integer linear programming; Historical and further notes on integer linear programming; References; Notation index; Author index; Subject index
Author: Jose M. Sallan Publisher: OmniaScience ISBN: 8494422936 Category : Mathematics Languages : en Pages : 108
Book Description
Linear programming is one of the most extensively used techniques in the toolbox of quantitative methods of optimization. One of the reasons of the popularity of linear programming is that it allows to model a large variety of situations with a simple framework. Furthermore, a linear program is relatively easy to solve. The simplex method allows to solve most linear programs efficiently, and the Karmarkar interior-point method allows a more efficient solving of some kinds of linear programming. The power of linear programming is greatly enhanced when came the opportunity of solving integer and mixed integer linear programming. In these models all or some of the decision variables are integers, respectively. In this book we provide a brief introduction to linear programming, together with a set of exercises that introduce some applications of linear programming. We will also provide an introduction to solve linear programming in R. For each problem a possible solution through linear programming is introduced, together with the code to solve it in R and its numerical solution.
Author: Robert J Vanderbei Publisher: Springer Science & Business Media ISBN: 1461476305 Category : Business & Economics Languages : en Pages : 420
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.
Author: A. Sultan Publisher: Elsevier ISBN: 1483297241 Category : Computers Languages : en Pages : 579
Book Description
Includes one IBM/PC floppy disk. System Requirements: Monochrome monitors, IBM-compatible machines, minimum: 286 IBM, DOS 2.0 or higher. This book gives a complete, concise introduction to the theory and applications of linear programming. It emphasizes the practical applications of mathematics, and makes the subject more accessible to individuals with varying mathematical abilities. It is one of the first rigorous linear programming texts that does not require linear algebra as a prerequisite. In addition, this text contains a floppy disk containing the program SIMPLEX, designed to help students solve problems using the computer. Key Features * Less rigorous mathematically - will appeal to individuals with varying mathematical abilities * Includes a floppy disk containing the program SIMPLEX and an appendix to help students solve problems using the computer * Includes chapters on network analysis and dynamic programming - topics of great interest to business majors and industrial engineers * Includes modem applications - selected computer programs for solving various max/min applications
Author: Robert J. Vanderbei Publisher: Springer ISBN: 0792381416 Category : Business & Economics Languages : en Pages : 440
Book Description
This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.£/LIST£.
Author: Sanjoy Dasgupta Publisher: McGraw-Hill Higher Education ISBN: 0077388496 Category : Computer algorithms Languages : en Pages : 338
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
Author: David J. Pannell Publisher: Wiley-Interscience ISBN: Category : Business & Economics Languages : en Pages : 362
Book Description
A comprehensive, nonmathematical guide to the practical application of linear programming models—for students and professionals in any field From finding the least-cost method for manufacturing a given product to determining the most profitable use for a given resource, there are countless practical applications for linear programming models. This self-contained book and disk set provides everything you need to know to apply linear programming to real-world situations—how to prepare input, how to interpret output, what to do if the model will not solve, and how to make your results useful and usable—while entrusting the hard-core arithmetic to the user-friendly computer package on disk. Written in clear prose that stays away from the complex mathematics underlying the technique, Introduction to Practical Linear Programming contains: A complete introduction to problem structure, assumptions, applications, and other core concepts A detailed, step-by-step guide to model construction (from a problem description to a useful model) and interpretation of output Linear programming examples and exercises from a range of real-life areas, including agriculture, manufacturing, finance, and advertising Important techniques for troubleshooting and error identification Procedures for testing how good your model is—how robust are the results?—and more System.
Proudly powered by WordPress |
Theme: Rits Blog by Crimson Themes.
Author: Jiri Matousek
Author: Paul R. Thie
Author: Mokhtar S. Bazaraa
Author: Alexander Schrijver
Author: Jose M. Sallan
Author: Robert J Vanderbei
Author: A. Sultan
Author: Robert J. Vanderbei
Author: Sanjoy Dasgupta
Author: David J. Pannell