Introduction to Operations Research 8th edition

Textbook Cover

Hillier and Lieberman
Publisher: McGraw-Hill Education


Access is contingent on use of this textbook in the instructor's classroom.

Academic Term Homework
Higher Education Single Term N/A
High School N/A

Online price per student per course or lab, bookstore price varies. Access cards can be packaged with most any textbook, please see your textbook rep or contact WebAssign

  • 1: Introduction
  • 2: Overveiw of the Operations Research Modeling Approach
  • 3: Introduction to Linear Programming
  • 4: Solving Linear Programming Problems: The Simplex Method
  • 5: The Theory of the Simplex Method
  • 6: Duality Theory and Sensitivity Analysis
  • 7: Other Algorithms for Linear Programming
  • 8: The Transportation and Assignment Problems
  • 9: Network Optimization Models
  • 10: Dynamic Programming
  • 11: Integer Programming
  • 12: Nonlinear Programming
  • 13: Metaheuristics
  • 14: Game Theory
  • 15: Decision Analysis
  • 16: Markov Chains (12)
  • 17: Queueing Theory (20)
  • 18: Inventory Theory
  • 19: Morkov Decision Processes
  • 20: Simulation
  • 21: The Art of Modeling with Spreadsheets
  • 22: Project Management with PERT/CPM
  • 23: Additional Special Types of Linear Programming Problems
  • 24: Probability Theory
  • 25: Reliability (11)
  • 26: The Application of Queueing Theory
  • 27: Forecasting
  • 28: Examples of Performing Simulations on Spreadsheets with Crystal Ball

Questions Available within WebAssign

Most questions from this textbook are available in WebAssign. The online questions are identical to the textbook questions except for minor wording changes necessary for Web use. Whenever possible, variables, numbers, or words have been randomized so that each student receives a unique version of the question. This list is updated nightly.

Question Availability Color Key
BLACK questions are available now
GRAY questions are under development


Group Quantity Questions
Chapter 1: Introduction
1 0  
Chapter 2: Overveiw of the Operations Research Modeling Approach
2 0  
Chapter 3: Introduction to Linear Programming
3 0  
Chapter 4: Solving Linear Programming Problems: The Simplex Method
4 0  
Chapter 5: The Theory of the Simplex Method
5 0  
Chapter 6: Duality Theory and Sensitivity Analysis
6 0  
Chapter 7: Other Algorithms for Linear Programming
7 0  
Chapter 8: The Transportation and Assignment Problems
8 0  
Chapter 9: Network Optimization Models
9 0  
Chapter 10: Dynamic Programming
10 0  
Chapter 11: Integer Programming
11 0  
Chapter 12: Nonlinear Programming
12 0  
Chapter 13: Metaheuristics
13 0  
Chapter 14: Game Theory
14 0  
Chapter 15: Decision Analysis
15 0  
Chapter 16: Markov Chains
16.2 3 02 03 03alt
16.3 1 03
16.4 3 02 04 05
16.5 2 04 09
16.6 2 01 04
16.8 1 01
Chapter 17: Queueing Theory
17.2 2 03 05
17.4 1 01
17.5 2 01 10
17.6 5 09 11 25 29 31
17.7 4 02 02alt 08 09
17.8 3 02 03 04
17.9 3 02 03 04
Chapter 18: Inventory Theory
18 0  
Chapter 19: Morkov Decision Processes
19 0  
Chapter 20: Simulation
20 0  
Chapter 25: Reliability
25.2 2 01 02
25.3 4 01 01alt 02 02alt
25.4 4 01 02 03 04
25.5 1 01
Total 43