1.

Record Nr.

UNINA9910139586003321

Autore

Bazaraa M. S

Titolo

Linear programming and network flows / / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali

Pubbl/distr/stampa

Hoboken, New Jersey : , : Wiley, , 2010

©2010

ISBN

1-118-16444-X

1-118-21132-4

1-118-16445-8

1-283-29453-2

9786613294531

0-471-70377-X

0-471-70376-1

Edizione

[Fourth edition.]

Descrizione fisica

1 online resource (764 pages)

Altri autori (Persone)

JarvisJohn J

SheraliHanif D. <1952->

Disciplina

519.7/2

Soggetti

Linear programming

Network analysis (Planning)

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

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

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, employing polynomial-time algorithms and various specializations of the simplex method.