Linear Programming: Mathematics, Theory and Algorithms


Book Description

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.




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 and Network Flows


Book Description

The authoritative guide to modeling and solving complex problems with linear programming—extensively revised, expanded, and updated The only book to treat both linear programming techniques and network flows under one cover, Linear Programming and Network Flows, Fourth Edition has been completely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problems in a variety of fields, including industrial engineering, management science, operations research, computer science, and mathematics. The book begins with basic results on linear algebra and convex analysis, and a geometrically motivated study of the structure of polyhedral sets is provided. Subsequent chapters include coverage of cycling in the simplex method, interior point methods, and sensitivity and parametric analysis. Newly added topics in the Fourth Edition include: The cycling phenomenon in linear programming and the geometry of cycling Duality relationships with cycling Elaboration on stable factorizations and implementation strategies Stabilized column generation and acceleration of Benders and Dantzig-Wolfe decomposition methods Line search and dual ascent ideas for the out-of-kilter algorithm Heap implementation comments, negative cost circuit insights, and additional convergence analyses for shortest path problems The authors present concepts and techniques that are illustrated by numerical examples along with insights complete with detailed mathematical analysis and justification. An emphasis is placed on providing geometric viewpoints and economic interpretations as well as strengthening the understanding of the fundamental ideas. Each chapter is accompanied by Notes and References sections that provide historical developments in addition to current and future trends. Updated exercises allow readers to test their comprehension of the presented material, and extensive references provide resources for further study. Linear Programming and Network Flows, Fourth Edition is an excellent book for linear programming and network flow courses at the upper-undergraduate and graduate levels. It is also a valuable resource for applied scientists who would like to refresh their understanding of linear programming and network flow techniques.




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.




Linear Programming Computation


Book Description

With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient-basis methods, face methods, and pivotal interior-point methods. In particular, it covers the determination of the optimal solution set, feasible-point simplex method, decomposition principle for solving large-scale problems, controlled-branch method based on generalized reduced simplex framework for solving integer LP problems.




Linear and Nonlinear Optimization


Book Description

​This textbook on Linear and Nonlinear Optimization is intended for graduate and advanced undergraduate students in operations research and related fields. It is both literate and mathematically strong, yet requires no prior course in optimization. As suggested by its title, the book is divided into two parts covering in their individual chapters LP Models and Applications; Linear Equations and Inequalities; The Simplex Algorithm; Simplex Algorithm Continued; Duality and the Dual Simplex Algorithm; Postoptimality Analyses; Computational Considerations; Nonlinear (NLP) Models and Applications; Unconstrained Optimization; Descent Methods; Optimality Conditions; Problems with Linear Constraints; Problems with Nonlinear Constraints; Interior-Point Methods; and an Appendix covering Mathematical Concepts. Each chapter ends with a set of exercises. The book is based on lecture notes the authors have used in numerous optimization courses the authors have taught at Stanford University. It emphasizes modeling and numerical algorithms for optimization with continuous (not integer) variables. The discussion presents the underlying theory without always focusing on formal mathematical proofs (which can be found in cited references). Another feature of this book is its inclusion of cultural and historical matters, most often appearing among the footnotes. "This book is a real gem. The authors do a masterful job of rigorously presenting all of the relevant theory clearly and concisely while managing to avoid unnecessary tedious mathematical details. This is an ideal book for teaching a one or two semester masters-level course in optimization – it broadly covers linear and nonlinear programming effectively balancing modeling, algorithmic theory, computation, implementation, illuminating historical facts, and numerous interesting examples and exercises. Due to the clarity of the exposition, this book also serves as a valuable reference for self-study." Professor Ilan Adler, IEOR Department, UC Berkeley "A carefully crafted introduction to the main elements and applications of mathematical optimization. This volume presents the essential concepts of linear and nonlinear programming in an accessible format filled with anecdotes, examples, and exercises that bring the topic to life. The authors plumb their decades of experience in optimization to provide an enriching layer of historical context. Suitable for advanced undergraduates and masters students in management science, operations research, and related fields." Michael P. Friedlander, IBM Professor of Computer Science, Professor of Mathematics, University of British Columbia




Encyclopedia of Optimization


Book Description

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that show the spectrum of research, the richness of ideas, and the breadth of applications that has come from this field. The second edition builds on the success of the former edition with more than 150 completely new entries, designed to ensure that the reference addresses recent areas where optimization theories and techniques have advanced. Particularly heavy attention resulted in health science and transportation, with entries such as "Algorithms for Genomics", "Optimization and Radiotherapy Treatment Design", and "Crew Scheduling".




Large Scale Linear and Integer Optimization: A Unified Approach


Book Description

This is a textbook about linear and integer linear optimization. There is a growing need in industries such as airline, trucking, and financial engineering to solve very large linear and integer linear optimization problems. Building these models requires uniquely trained individuals. Not only must they have a thorough understanding of the theory behind mathematical programming, they must have substantial knowledge of how to solve very large models in today's computing environment. The major goal of the book is to develop the theory of linear and integer linear optimization in a unified manner and then demonstrate how to use this theory in a modern computing environment to solve very large real world problems. After presenting introductory material in Part I, Part II of this book is de voted to the theory of linear and integer linear optimization. This theory is developed using two simple, but unifying ideas: projection and inverse projec tion. Through projection we take a system of linear inequalities and replace some of the variables with additional linear inequalities. Inverse projection, the dual of this process, involves replacing linear inequalities with additional variables. Fundamental results such as weak and strong duality, theorems of the alternative, complementary slackness, sensitivity analysis, finite basis the orems, etc. are all explained using projection or inverse projection. Indeed, a unique feature of this book is that these fundamental results are developed and explained before the simplex and interior point algorithms are presented.




Nonlinear Equations and Optimisation


Book Description

After a review of historical developments in convergence analysis for Newton's and Newton-like methods, 18 papers deal in depth with various classical, or neo-classical approaches, as well as newer ideas on optimization and solving linear equations. A sampling of topics: truncated Newton methods, sequential quadratic programming for large- scale nonlinear optimization, and automatic differentiation of algorithms. This monograph, one of seven volumes in the set, is also published as the Journal of Computational and Applied Mathematics; v.124 (2000). Indexed only by author. c. Book News Inc.




Linear Programming and Extensions


Book Description

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 mathematical technique used to optimize a situation. It can be used to minimize traffic congestion or to maximize the scheduling of airline flights. He formulated its basic theoretical model and discovered its underlying computational algorithm, the "simplex method," in a pathbreaking memorandum published by the United States Air Force in early 1948. Linear Programming and Extensions provides an extraordinary account of the subsequent development of his subject, including research in mathematical theory, computation, economic analysis, and applications to industrial problems. Dantzig first achieved success as a statistics graduate student at the University of California, Berkeley. One day he arrived for a class after it had begun, and assumed the two problems on the board were assigned for homework. When he handed in the solutions, he apologized to his professor, Jerzy Neyman, for their being late but explained that he had found the problems harder than usual. About six weeks later, Neyman excitedly told Dantzig, "I've just written an introduction to one of your papers. Read it so I can send it out right away for publication." Dantzig had no idea what he was talking about. He later learned that the "homework" problems had in fact been two famous unsolved problems in statistics.