Introduction to operations research / Frederick S. Hillier, Gerald J. Lieberman.
Publication details: New York ; Boston : McGraw-Hill Higher Education, c2010.Edition: 9th editionDescription: xxiv, 1047 p. : ill. ; 27 cmISBN:- 9780073376295 (hbk. : alk. paper)
- 0073376299 (hbk. : alk. paper)
- 9780077298340 (set)
- 0077298349 (set)
- 658.4032 22 HIL
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Book Closed Access
|
Engineering Library | 658.4032 HIL 1 (Browse shelf(Opens below)) | 1 | Available | BUML23111568 |
Chapter 1:
Introduction
1.1 The Origins of operations research
1.2 The nature of operations research
1.3 The impact of operations research
Chapter 2 Overview of the operations research modeling approach
2.1 Defining the problem and gathering data
2.2 Formulating a Mathematical model
2.3 Deriving solution from the model
etc
Chapter 3 : Introduction to linear programming
3.1 Prototype example
3.2 The linear programming model
3.3 Assumptions of linear programming
etc
Chapter 4 : Solving Linear programming problems : The simplx method
4.1 The essence of the simplex method
4.2 Setting up the simplex method
4.3 The algebra of the simplex method
etc
Chapter 5 : The theory of the simplex method
5.1 Foundations of the simplex method
5.2 The simplex method in matrix form
5.3 A fundamental insight
etc
Chapter 6: Duality theory and sensitivity analysis
6.1 The essence of duality theory
6.2 Economic interpretation of duality
6.3 Primal-dual relationships
etc
Chapter7 : Other algorithms for linear programming
7.1 The dual simplex method
7.2 Parametric linear programming
7.3 The upper bound techniques
etc
Chapter 8 : The transformation and assignment problems
8.1 The transformation problem
8.2 A streamlined simplex method for transportation problem
8.3 The assignment problem
etc
Chapter 9: Network optimization models
9.1 Prototype example
9.2 The terminology of networks
9.3 The shortest path problem
etc
Chapter 10 : Dynamic programming
10.1 A prototype example for dynamic programming
10.2 Characteristics of dynamic programming problems
10.3 Deterministic dynamic programming
etc
Chapter 11 : Integer programming
11.1 Prototypes example
11.2 Some BIP applications
11.3 Innovation uses of binary variables in model formulation
etc
Chapter 12 : Nonlinear programming
12.1 Sample applications
12.2 Graphic illustration of nonlinear programming problems
12.3 Types of nonlinear programming problems
etc
Chapter 13. Metaheuristics
13.1 The nature of metaheuristics
13.2 Tabu search
13.3 Simulated Annealing
etc
Chapter 14 : Game theory
14.1 The formulation of two person, zero sum games
14.2 Solving simple games- a prototype example
14.3 Games with mixed strategies
etc
Chapter 15 : Decision analysis
15.1 A prototype example
15.2 Decision making without experimentation
15.3 Decision making with experimentation
etc
Chapter 16 : Markov chains
16.1 Stochastic processes
16.2 Markov chains
16.3 Chapman- kolmogorov equations
etc
Chapter 17 : Queuing theory
17.1 Prototype example
17.2 Basic structure of queuing models
17.3 Examples of real queuing systems
etc
Chapter 18 : Inventory theory
18.1 Examples
18.2 Components of inventory models
18.3 Deterministic continuous review models
etc
Chapter 19. Markov Decision processes
91.1 A prototypes example
19.2 A model fro markov decision processes
19.3 Linear programming and optimal policies
etc
Chapter 20 : Simulation
201. The essence of simulation
20.2 Some common types of applications of simulations
20.3 Generation of random numbers
etc
Includes bibliographical references . _ Index : p1023-1047
There are no comments on this title.