Linear Programming and Extensions / / George Dantzig.
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...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2016] ©1963 |
Year of Publication: | 2016 |
Language: | English |
Series: | Princeton Landmarks in Mathematics and Physics ;
48 |
Online Access: | |
Physical Description: | 1 online resource (656 p.) :; 99 figs. 64 tables |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9781400884179 |
---|---|
ctrlnum |
(DE-B1597)474335 (OCoLC)953848356 |
collection |
bib_alma |
record_format |
marc |
spelling |
Dantzig, George, author. aut http://id.loc.gov/vocabulary/relators/aut Linear Programming and Extensions / George Dantzig. Princeton, NJ : Princeton University Press, [2016] ©1963 1 online resource (656 p.) : 99 figs. 64 tables text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Princeton Landmarks in Mathematics and Physics ; 48 Frontmatter -- Preface -- Contents -- 1. The Linear Programming Concept -- 2. Origins and Influences -- 3. Formulating a Linear Programming Model -- 4. Linear Equation and Inequality Systems -- 5. The Simplex Method -- 6. Proof of the Simplex Algorithm and the Duality Theorem -- 7. The Geometry of Linear Programs -- 8. Pivoting, Vector Spaces, Matrices, and Inverses -- 9. The Simplex Method Using Multipliers -- 10. Finiteness of the Simplex Method under Perturbation -- 11. Variants of the Simplex Algorithm -- 12. The Price Concept in Linear Programming -- 13. Games And Linear Programs -- 14. The Classical Transportation Problem -- 15. Optimal Assignment and Other Distribution Problems -- 16. The Transshipment Problem -- 17. Networks and the Transshipment Problem -- 18. Variables with Upper Bounds -- 19. Maximal Flows in Networks -- 20. The Primal-Dual Method for Transportation Problems -- 21. The Weighted Distribution Problem -- 22. Programs with Variable Coefficients -- 23. A Decomposition Principle for Linear Programs -- 24. Convex Programming -- 25. Uncertainty -- 26. Discrete-Variable Extremum Problems -- 27. Stigler's Nutrition Model: An Example of Formulation and Solution -- 28. The Allocation of Aircraft to Routes under Uncertain Demand -- Bibliography -- Subject Index -- Name Index -- Selected Rand Books restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) Linear programming. MATHEMATICS / Linear & Nonlinear Programming. bisacsh Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 9783110442496 print 9780691059136 https://doi.org/10.1515/9781400884179 https://www.degruyter.com/isbn/9781400884179 Cover https://www.degruyter.com/cover/covers/9781400884179.jpg |
language |
English |
format |
eBook |
author |
Dantzig, George, Dantzig, George, |
spellingShingle |
Dantzig, George, Dantzig, George, Linear Programming and Extensions / Princeton Landmarks in Mathematics and Physics ; Frontmatter -- Preface -- Contents -- 1. The Linear Programming Concept -- 2. Origins and Influences -- 3. Formulating a Linear Programming Model -- 4. Linear Equation and Inequality Systems -- 5. The Simplex Method -- 6. Proof of the Simplex Algorithm and the Duality Theorem -- 7. The Geometry of Linear Programs -- 8. Pivoting, Vector Spaces, Matrices, and Inverses -- 9. The Simplex Method Using Multipliers -- 10. Finiteness of the Simplex Method under Perturbation -- 11. Variants of the Simplex Algorithm -- 12. The Price Concept in Linear Programming -- 13. Games And Linear Programs -- 14. The Classical Transportation Problem -- 15. Optimal Assignment and Other Distribution Problems -- 16. The Transshipment Problem -- 17. Networks and the Transshipment Problem -- 18. Variables with Upper Bounds -- 19. Maximal Flows in Networks -- 20. The Primal-Dual Method for Transportation Problems -- 21. The Weighted Distribution Problem -- 22. Programs with Variable Coefficients -- 23. A Decomposition Principle for Linear Programs -- 24. Convex Programming -- 25. Uncertainty -- 26. Discrete-Variable Extremum Problems -- 27. Stigler's Nutrition Model: An Example of Formulation and Solution -- 28. The Allocation of Aircraft to Routes under Uncertain Demand -- Bibliography -- Subject Index -- Name Index -- Selected Rand Books |
author_facet |
Dantzig, George, Dantzig, George, |
author_variant |
g d gd g d gd |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Dantzig, George, |
title |
Linear Programming and Extensions / |
title_full |
Linear Programming and Extensions / George Dantzig. |
title_fullStr |
Linear Programming and Extensions / George Dantzig. |
title_full_unstemmed |
Linear Programming and Extensions / George Dantzig. |
title_auth |
Linear Programming and Extensions / |
title_alt |
Frontmatter -- Preface -- Contents -- 1. The Linear Programming Concept -- 2. Origins and Influences -- 3. Formulating a Linear Programming Model -- 4. Linear Equation and Inequality Systems -- 5. The Simplex Method -- 6. Proof of the Simplex Algorithm and the Duality Theorem -- 7. The Geometry of Linear Programs -- 8. Pivoting, Vector Spaces, Matrices, and Inverses -- 9. The Simplex Method Using Multipliers -- 10. Finiteness of the Simplex Method under Perturbation -- 11. Variants of the Simplex Algorithm -- 12. The Price Concept in Linear Programming -- 13. Games And Linear Programs -- 14. The Classical Transportation Problem -- 15. Optimal Assignment and Other Distribution Problems -- 16. The Transshipment Problem -- 17. Networks and the Transshipment Problem -- 18. Variables with Upper Bounds -- 19. Maximal Flows in Networks -- 20. The Primal-Dual Method for Transportation Problems -- 21. The Weighted Distribution Problem -- 22. Programs with Variable Coefficients -- 23. A Decomposition Principle for Linear Programs -- 24. Convex Programming -- 25. Uncertainty -- 26. Discrete-Variable Extremum Problems -- 27. Stigler's Nutrition Model: An Example of Formulation and Solution -- 28. The Allocation of Aircraft to Routes under Uncertain Demand -- Bibliography -- Subject Index -- Name Index -- Selected Rand Books |
title_new |
Linear Programming and Extensions / |
title_sort |
linear programming and extensions / |
series |
Princeton Landmarks in Mathematics and Physics ; |
series2 |
Princeton Landmarks in Mathematics and Physics ; |
publisher |
Princeton University Press, |
publishDate |
2016 |
physical |
1 online resource (656 p.) : 99 figs. 64 tables Issued also in print. |
contents |
Frontmatter -- Preface -- Contents -- 1. The Linear Programming Concept -- 2. Origins and Influences -- 3. Formulating a Linear Programming Model -- 4. Linear Equation and Inequality Systems -- 5. The Simplex Method -- 6. Proof of the Simplex Algorithm and the Duality Theorem -- 7. The Geometry of Linear Programs -- 8. Pivoting, Vector Spaces, Matrices, and Inverses -- 9. The Simplex Method Using Multipliers -- 10. Finiteness of the Simplex Method under Perturbation -- 11. Variants of the Simplex Algorithm -- 12. The Price Concept in Linear Programming -- 13. Games And Linear Programs -- 14. The Classical Transportation Problem -- 15. Optimal Assignment and Other Distribution Problems -- 16. The Transshipment Problem -- 17. Networks and the Transshipment Problem -- 18. Variables with Upper Bounds -- 19. Maximal Flows in Networks -- 20. The Primal-Dual Method for Transportation Problems -- 21. The Weighted Distribution Problem -- 22. Programs with Variable Coefficients -- 23. A Decomposition Principle for Linear Programs -- 24. Convex Programming -- 25. Uncertainty -- 26. Discrete-Variable Extremum Problems -- 27. Stigler's Nutrition Model: An Example of Formulation and Solution -- 28. The Allocation of Aircraft to Routes under Uncertain Demand -- Bibliography -- Subject Index -- Name Index -- Selected Rand Books |
isbn |
9781400884179 9783110442496 9780691059136 |
url |
https://doi.org/10.1515/9781400884179 https://www.degruyter.com/isbn/9781400884179 https://www.degruyter.com/cover/covers/9781400884179.jpg |
illustrated |
Not Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
519 - Probabilities & applied mathematics |
dewey-full |
519.6 |
dewey-sort |
3519.6 |
dewey-raw |
519.6 |
dewey-search |
519.6 |
doi_str_mv |
10.1515/9781400884179 |
oclc_num |
953848356 |
work_keys_str_mv |
AT dantziggeorge linearprogrammingandextensions |
status_str |
n |
ids_txt_mv |
(DE-B1597)474335 (OCoLC)953848356 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 |
is_hierarchy_title |
Linear Programming and Extensions / |
container_title |
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 |
_version_ |
1806143646140989440 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05856nam a22006855i 4500</leader><controlfield tag="001">9781400884179</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20161963nju fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)979836557</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400884179</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400884179</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)474335</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)953848356</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT017000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dantzig, George, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear Programming and Extensions /</subfield><subfield code="c">George Dantzig.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©1963</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (656 p.) :</subfield><subfield code="b">99 figs. 64 tables</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Landmarks in Mathematics and Physics ;</subfield><subfield code="v">48</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">1. The Linear Programming Concept -- </subfield><subfield code="t">2. Origins and Influences -- </subfield><subfield code="t">3. Formulating a Linear Programming Model -- </subfield><subfield code="t">4. Linear Equation and Inequality Systems -- </subfield><subfield code="t">5. The Simplex Method -- </subfield><subfield code="t">6. Proof of the Simplex Algorithm and the Duality Theorem -- </subfield><subfield code="t">7. The Geometry of Linear Programs -- </subfield><subfield code="t">8. Pivoting, Vector Spaces, Matrices, and Inverses -- </subfield><subfield code="t">9. The Simplex Method Using Multipliers -- </subfield><subfield code="t">10. Finiteness of the Simplex Method under Perturbation -- </subfield><subfield code="t">11. Variants of the Simplex Algorithm -- </subfield><subfield code="t">12. The Price Concept in Linear Programming -- </subfield><subfield code="t">13. Games And Linear Programs -- </subfield><subfield code="t">14. The Classical Transportation Problem -- </subfield><subfield code="t">15. Optimal Assignment and Other Distribution Problems -- </subfield><subfield code="t">16. The Transshipment Problem -- </subfield><subfield code="t">17. Networks and the Transshipment Problem -- </subfield><subfield code="t">18. Variables with Upper Bounds -- </subfield><subfield code="t">19. Maximal Flows in Networks -- </subfield><subfield code="t">20. The Primal-Dual Method for Transportation Problems -- </subfield><subfield code="t">21. The Weighted Distribution Problem -- </subfield><subfield code="t">22. Programs with Variable Coefficients -- </subfield><subfield code="t">23. A Decomposition Principle for Linear Programs -- </subfield><subfield code="t">24. Convex Programming -- </subfield><subfield code="t">25. Uncertainty -- </subfield><subfield code="t">26. Discrete-Variable Extremum Problems -- </subfield><subfield code="t">27. Stigler's Nutrition Model: An Example of Formulation and Solution -- </subfield><subfield code="t">28. The Allocation of Aircraft to Routes under Uncertain Demand -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Subject Index -- </subfield><subfield code="t">Name Index -- </subfield><subfield code="t">Selected Rand Books</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Linear programming.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Linear & Nonlinear Programming.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="z">9783110442496</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691059136</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400884179</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400884179</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400884179.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044249-6 Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="c">1927</subfield><subfield code="d">1999</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection> |