000 02404cam a2200397 i 4500
999 _c478551
_d478551
001 18132406
003 NUST
005 20180604053509.0
008 140429r20141984nyua b 001 0 eng
010 _a 2014016975
020 _a9780486493763 (paperback)
020 _a0486493768 (paperback)
038 _aSNS Library
040 _aDLC
_beng
_cDLC
_erda
_dDLC
042 _apcc
050 0 0 _aT57.74
_b.S653 2014
082 0 0 _a519.72
_223
084 _aMAT017000
_2bisacsh
100 1 _aSolow, Daniel,
_eauthor.
_910837
245 1 0 _aLinear Programming :
_bAn introduction to Finite Improvement Algorithms
_cDaniel Solow.
250 _aSecond Dover edition.
264 1 _aMineola, New York :
_bDover Publications, Inc.,
_c[2014]
300 _axv, 414 pages :
_billustrations ;
_c23 cm
336 _atext
_2rdacontent
337 _aunmediated
_2rdamedia
338 _avolume
_2rdacarrier
500 _a"Second edition."
500 _aReprint of: New York : North-Holland, ©1984. With introduction and an appendix C.
504 _aIncludes bibliographical references and index.
520 _a"Suitable for undergraduate students of mathematics and graduate students of operations research and engineering, this text covers the basic theory and computation for a first course in linear programming. In addition to substantial material on mathematical proof techniques and sophisticated computation methods, the treatment features numerous examples and exercises. An introductory chapter offers a systematic and organized approach to problem formulation. Subsequent chapters explore geometric motivation, proof techniques, linear algebra and algebraic steps related to the simplex algorithm, standard phase 1 problems, and computational implementation of the simplex algorithm. Additional topics include duality theory, issues of sensitivity and parametric analysis, techniques for handling bound constraints, and network flow problems. Helpful appendixes conclude the text, including a new addition that explains how to use Excel to solve linear programming problems"--
_cProvided by publisher.
650 0 _aLinear programming.
_910838
650 7 _aMATHEMATICS / Linear Programming.
_2bisacsh
_910839
906 _a7
_bcbc
_corignew
_d1
_eecip
_f20
_gy-gencatlg
942 _2ddc
_cBK