LEADER 03538nam 2200817 450 001 9910139586003321 005 20230725053510.0 010 $a1-118-16444-X 010 $a1-118-21132-4 010 $a1-118-16445-8 010 $a1-283-29453-2 010 $a9786613294531 010 $a0-471-70377-X 010 $a0-471-70376-1 035 $a(CKB)2550000000055743 035 $a(EBL)818670 035 $a(OCoLC)758387215 035 $a(SSID)ssj0000555042 035 $a(PQKBManifestationID)11358102 035 $a(PQKBTitleCode)TC0000555042 035 $a(PQKBWorkID)10519045 035 $a(PQKB)10687176 035 $a(SSID)ssj0000608179 035 $a(PQKBManifestationID)11384954 035 $a(PQKBTitleCode)TC0000608179 035 $a(PQKBWorkID)10592018 035 $a(PQKB)11395537 035 $a(MiAaPQ)EBC819139 035 $a(MiAaPQ)EBC818670 035 $a(JP-MeL)3000065396 035 $a(MiAaPQ)EBC4032905 035 $a(Au-PeEL)EBL819139 035 $a(CaPaEBR)ebr10814706 035 $a(CaONFJC)MIL329453 035 $a(OCoLC)778339088 035 $a(Au-PeEL)EBL4032905 035 $a(CaPaEBR)ebr11108790 035 $a(OCoLC)747540689 035 $a(EXLCZ)992550000000055743 100 $a20131220d2010 uy 0 101 0 $aeng 135 $aurcn#---||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aLinear programming and network flows /$fMokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali 205 $aFourth edition. 210 1$aHoboken, New Jersey :$cWiley,$d2010. 210 4$dİ2010 215 $a1 online resource (764 pages) 300 $aDescription based upon print version of record. 311 $a0-470-46272-8 311 $a0-471-48599-3 320 $aIncludes bibliographical references and index. 327 $aLinear Programming and Network Flows; CONTENTS; Preface; ONE: INTRODUCTION; 1.1 The Linear Programming Problem; 1.2 Linear Programming Modeling and Examples; 1.3 Geometric Solution; 1.4 The Requirement Space; 1.5 Notation; Exercises; Notes and References; TWO: LINEAR ALGEBRA, CONVEX ANALYSIS, AND POLYHEDRAL SETS; 2.1 Vectors; 2.2 Matrices; 2.3 Simultaneous Linear Equations; 2.4 Convex Sets and Convex Functions; 2.5 Polyhedral Sets and Polyhedral Cones; 2.6 Extreme Points, Faces, Directions, and Extreme Directions of Polyhedral Sets: Geometric Insights; 2.7 Representation of Polyhedral Sets 330 $aLinear Programming and Network Flows, now in its third edition, addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequility constraints. This book:* Provides methods for modeling complex problems via effective algorithms on modern computers.* Presents the general theory and characteristics of optimization problems, along with effective solution algorithms.* Explores linear programming (LP) and network flows, employing polynomial-time algorithms and various specializations of the simplex method. 606 $aLinear programming 606 $aNetwork analysis (Planning) 615 0$aLinear programming. 615 0$aNetwork analysis (Planning) 676 $a519.7/2 700 $aBazaraa$b M. S$03992 701 $aJarvis$b John J$03993 701 $aSherali$b Hanif D.$f1952-$07925 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910139586003321 996 $aLinear programming and network flows$9378217 997 $aUNINA