Linear programming and its applications
assignmentcyclinggeometric solutionHungarian methodmax flowmin cost flowpolyhedral convex setsshortest pathsimplex algorithmtextbook
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) 2-person games (91A05)
As stated in the preface, this textbook ``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 small-scale problems, both in the general sense and in the specific applications where these problems naturally occur. Chapter 1 introduces some examples, canonical forms of a linear program (LP for short), polyhedral convex sets and the geometric solution of an LP in \(R^ 2\). Chapter 2 is entirely devoted to the development of the simplex algorithm for the solution of general LP's. It uses Tucker's tableau form to record the LP. The problem of cycling is also addressed. Chapter 2 covers ``non- canonical LP's, e.g. problems with unconstrained variables or with equations as constraints, and shows how these problems can be converted into canonical form. Duality is the central subject of Chapter 4 with a discussion of the dual simplex method and the duality theorem. The second part of the book is devoted to applications of linear programming. Chapter 5 deals with game theory, in particular two-person zero-sum matrix games, a linear programming formulation of matrix games, von Neumann's minimax theorem, the solution of the previous matrix game and at the end with a discussion of two more examples, ``poker-like card games. The next chapter discusses transportation and assignment problems as well as their solution (via a dual simplex algorithm and the Hungarian method, respectively). Network flow problems, i.e. max flow, shortest path and min cost flow problems and their solution (by classical algorithms) are the subject of Chapter 7. Two appendices survey basic matrix algebra and probability theory. The exposition is accompanied by many useful exercises.
- Linear programming: foundations and extensions
- Optimal vaccination strategies for a community of households
- The many facets of linear programming
- Linear programming: mathematics, theory and algorithms
- On the simplex algorithm initializing
- Gradient-based nonlinear microstructure design
- scientific article; zbMATH DE number 4130564 (Why is no real title available?)
- scientific article; zbMATH DE number 2132174 (Why is no real title available?)
- Algebraic simplex initialization combined with the nonfeasible basis method
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- Linear programming and game theory
- Modeling a game into a linear programming problem: the benefits
- scientific article; zbMATH DE number 3903854 (Why is no real title available?)
- scientific article; zbMATH DE number 48466 (Why is no real title available?)
- scientific article; zbMATH DE number 193129 (Why is no real title available?)
- scientific article; zbMATH DE number 728195 (Why is no real title available?)
- Lineare Optimierung – eine anwendungsorientierte Einführung in Operations Research
- Grey linear programming, its solving approach, and its application
- Grey bottleneck transportation problems
- scientific article; zbMATH DE number 7377870 (Why is no real title available?)
- Multirow Intersection Cuts Based on the Infinity Norm
- Computing probabilistic bisimilarity distances for probabilistic automata
- Computing probabilistic bisimilarity distances for probabilistic automata
- Closing the iteration gap in linear programming with a new kernel function
- Understanding and using linear programming
This page was built for publication: Linear programming and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4693067)
