03538nam 2200817 450 991013958600332120230725053510.01-118-16444-X1-118-21132-41-118-16445-81-283-29453-297866132945310-471-70377-X0-471-70376-1(CKB)2550000000055743(EBL)818670(OCoLC)758387215(SSID)ssj0000555042(PQKBManifestationID)11358102(PQKBTitleCode)TC0000555042(PQKBWorkID)10519045(PQKB)10687176(SSID)ssj0000608179(PQKBManifestationID)11384954(PQKBTitleCode)TC0000608179(PQKBWorkID)10592018(PQKB)11395537(MiAaPQ)EBC819139(MiAaPQ)EBC818670(JP-MeL)3000065396(MiAaPQ)EBC4032905(Au-PeEL)EBL819139(CaPaEBR)ebr10814706(CaONFJC)MIL329453(OCoLC)778339088(Au-PeEL)EBL4032905(CaPaEBR)ebr11108790(OCoLC)747540689(EXLCZ)99255000000005574320131220d2010 uy 0engurcn#---|||||rdacontentrdamediardacarrierLinear programming and network flows /Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. SheraliFourth edition.Hoboken, New Jersey :Wiley,2010.©20101 online resource (764 pages)Description based upon print version of record.0-470-46272-8 0-471-48599-3 Includes bibliographical references and index.Linear 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 SetsLinear 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.Linear programmingNetwork analysis (Planning)Linear programming.Network analysis (Planning)519.7/2Bazaraa M. S3992Jarvis John J3993Sherali Hanif D.1952-7925MiAaPQMiAaPQMiAaPQBOOK9910139586003321Linear programming and network flows378217UNINA