New York
en
56138101
2003
Linear programming. 2, Theory and extensions
2003
56138101
Theory and extensions
Geometry of Linear Inequality Systems and the Simplex Method -- Duality and Theorems of the Alternatives -- Early Interior-Point Methods -- Interior-Point Methods -- Degeneracy -- Variants of the Simplex Method -- Transportation Problem and Variations -- Network Flow Theory -- Generalized Upper Bounds -- Decomposition of Large-Scale Systems -- Stochastic Programming: Introduction -- Two-Stage Stochastic Programs -- Appendix: Probability Theory: Overview.
Electronic books
Linear programming represents one of the major applications of mathematics to business, industry, and economics. It provides a methodology for optimizing an output given that is a linear function of a number of inputs. George Dantzig is widely regarded as the founder of the subject with his invention of the simplex algorithm in the 1940's. This second volume is intended to add to the theory of the items discussed in the first volume. It also includes additional advanced topics such as variants of the simplex method; interior point methods (early and current methods), GUB, decomposition, integer programming, and game theory. Graduate students in the fields of operations research, industrial engineering and applied mathematics will find this volume of particular interest.
9781280188817
1280188812
Thapa
Mukund Narain
Mukund Narain Thapa
Dantzig
George B.
George Bernard
George Bernard Dantzig
1914
2005,
Linjär programmering
Springer
Springer series in operations research
Springer series in operations research.
nyu
2016-07-26
Linear programming
9780387215693
0387215697
MATHEMATICS--Linear & Nonlinear Programming