{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":25,"n_cols":5,"rows_kept":25,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[12,2,12,3],[13,2,13,3],[14,2,14,3],[15,2,15,3],[17,2,17,3],[18,2,18,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996209051503316"]
[null,null,"Autore",null,"Bazaraa M. S"]
[null,null,"Titolo",null,"Linear programming and network flows / / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, New Jersey : , : Wiley, , 2010"]
[{"$nulls":4},"©2010"]
[null,null,"ISBN",null,"1-118-16444-X"]
[{"$nulls":4},"1-118-21132-4"]
[{"$nulls":4},"1-118-16445-8"]
[{"$nulls":4},"1-283-29453-2"]
[{"$nulls":4},"9786613294531"]
[{"$nulls":4},"0-471-70377-X"]
[{"$nulls":4},"0-471-70376-1"]
[null,null,"Edizione",null,"[Fourth edition.]"]
[null,null,"Descrizione fisica",null,"1 online resource (764 pages)"]
[null,null,"Disciplina",null,"519.7/2"]
[null,null,"Soggetti",null,"Linear programming"]
[{"$nulls":4},"Network analysis (Planning)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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 Sets"]
[null,null,null,"Sommario/riassunto","Linear 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, "]
[{"$nulls":4},"employing polynomial-time algorithms and various specializations of the simplex method."]