LEADER 03845nam 2200565 450 001 9910808851903321 005 20221206101742.0 010 $a0-08-053079-6 035 $a(CKB)1000000000384907 035 $a(EBL)1901192 035 $a(SSID)ssj0000371914 035 $a(PQKBManifestationID)12109080 035 $a(PQKBTitleCode)TC0000371914 035 $a(PQKBWorkID)10413606 035 $a(PQKB)10585118 035 $a(MiAaPQ)EBC1901192 035 $a(EXLCZ)991000000000384907 100 $a20150120h19951995 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aElementary linear programming with applications /$fBernard Kolman, Robert E. Beck 205 $a2nd ed. 210 1$aSan Diego, California ;$aLondon, England :$cAcademic Press,$d1995. 210 4$dİ1995 215 $a1 online resource (474 p.) 225 1 $aComputer Science and Scientific Computing 300 $aDescription based upon print version of record. 311 $a1-322-55513-3 311 $a0-12-417910-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aFront Cover; Elementary Linear Programming with Applications; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Prologue; Chapter 0. Review of Linear Algebra (Optional); 0.1 Matrices; 0.2 Gauss-Jordan Reduction; 0.3 The Inverse of a Matrix; 0.4 Subspaces; 0.5 Linear Independence and Basis; Further Reading; Chapter 1. Introduction to Linear Programming; 1.1 The Linear Programming Problem; 1.2 Matrix Notation; 1.3 Geometry of Linear Programming Problems; 1.4 The Extreme Point Theorem; 1.5 Basic Solutions; Further Reading; Chapter 2. The Simplex Method 327 $a2.1 The Simplex Method for Problems in Standard Form2.2 Degeneracy and Cycling (Optional); 2.3 Artificial Variables; Further Reading; Chapter 3. Further Topics in Linear Programming; 3.1 Duality; 3.2 The Duality Theorem; 3.3 Computational Relations between the Primal and Dual Problems; 3.4 The Dual Simplex Method; 3.5 The Revised Simplex Method; 3.6 Sensitivity Analysis; 3.7 Computer Aspects (Optional); Further Reading; Chapter 4. Integer Programming; 4.1 Examples; 4.2 Cutting Plane Methods; 4.3 Branch and Bound Methods; 4.4 Computer Aspects (Optional); Further Reading 327 $aChapter 5. Special Types of Linear Programming Problems5.1 The Transportation Problem; 5.2 The Assignment Problem; 5.3 Graphs and Networks: Basic Definitions; 5.4 The Maximal Flow Problem; 5.5 The Shortest Route Problem; 5.6 The Critical Path Method; 5.7 Computer Aspects (Optional); APPENDIX A: Karmarkar's Algorithm; APPENDIX B: Microcomputer Software; APPENDIX C: SMPX; Answers to Odd-Numbered Exercises; Index 330 $aLinear programming finds the least expensive way to meet given needs with available resources. Its results are used in every area of engineering and commerce: agriculture, oil refining, banking, and air transport. Authors Kolman and Beck present the basic notions of linear programming and illustrate how they are used to solve important common problems. The software on the included disk leads students step-by-step through the calculations. The Second Edition is completely revised and provides additional review material on linear algebra as well as complete coverage of elementary linear program 410 0$aComputer science and scientific computing. 606 $aLinear programming 615 0$aLinear programming. 676 $a519.7/2 700 $aKolman$b Bernard$013616 702 $aBeck$b Robert Edward$f1941- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910808851903321 996 $aElementary Linear Programming with Applications$9347876 997 $aUNINA