000			04760cam a2200361Mi 4500
001			ocn953848356
005			20240726105026.0
008			160722s2016 xx o 000 0 eng d
040			_aIDEBK _beng _epn _erda _cIDEBK _dYDXCP _dNT _dOCLCF _dOCLCQ _dIGB _dAGLDB _dDEGRU _dDEBBG _dOCLCA _dD6H _dCN8ML _dSTF _dOCLCQ _dVTS _dOCLCA _dLVT _dS9I
020			_a9781400884179 _q((electronic)l(electronic)ctronic)
029	1		_aCHVBK _b530837285
029	1		_aCHBIS _b011306282
050	0	4	_aT57 _b.L564 2016
100	1		_aDantzig, George B. _q(George Bernard), _d1914-2005. _e1
245	1	0	_aLinear Programming and Extensions.
260			_bPrinceton University Press, _c(c)2016.
300			_a1 online resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_adata file _2rda
490	0		_aPrinceton Landmarks in Mathematics and Physics
504			_a2
505	0	0	_tFrontmatter -- _tPreface -- _tContents -- _t1. The Linear Programming Concept -- _t2. Origins and Influences -- _t3. Formulating a Linear Programming Model -- _t4. Linear Equation and Inequality Systems -- _t5. The Simplex Method -- _t6. Proof of the Simplex Algorithm and the Duality Theorem -- _t7. The Geometry of Linear Programs -- _t8. Pivoting, Vector Spaces, Matrices, and Inverses -- _t9. The Simplex Method Using Multipliers -- _t10. Finiteness of the Simplex Method under Perturbation -- _t11. Variants of the Simplex Algorithm -- _t12. The Price Concept in Linear Programming -- _t13. Games And Linear Programs -- _t14. The Classical Transportation Problem -- _t15. Optimal Assignment and Other Distribution Problems -- _t16. The Transshipment Problem -- _t17. Networks and the Transshipment Problem -- _t18. Variables with Upper Bounds -- _t19. Maximal Flows in Networks -- _t20. The Primal-Dual Method for Transportation Problems -- _t21. The Weighted Distribution Problem -- _t22. Programs with Variable Coefficients -- _t23. A Decomposition Principle for Linear Programs -- _t24. Convex Programming -- _t25. Uncertainty -- _t26. Discrete-Variable Extremum Problems -- _t27. Stigler's Nutrition Model: An Example of Formulation and Solution -- _t28. The Allocation of Aircraft to Routes under Uncertain Demand -- _tBibliography -- _tSubject Index -- _tName Index -- _tSelected Rand Books
520	0		_aIn 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.
530			_a2 _ub
650		0	_aLinear programming.
650		0	_aMathematical optimization.
655		1	_aElectronic Books.
856	4	0	_uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1290571&site=eds-live&custid=s3260518 _zClick to access digital title | log in using your CIU ID number and my.ciu.edu password
942			_cOB _D _eEB _hT. _m2016 _QOL _R _x _8NFIC _2LOC
999			_c86437 _d86437
902			_a1 _bCynthia Snell _c1 _dCynthia Snell