Errata, 8th 7:56:05 PM 10/13/2007 Page 1 of 2
Errata
Taha, Operations Research, 8/e
(Updated Oct. 14, 2007)
Dates for new corrections since last update (May 11, 2007) are highlighted in red
Date Page Original text Corrected text
2-24-07 vii, line 18 from bottom 12.3 Selected LP Applications 2.3 Selected LP Applications
vii, line 10 from bottom 2.4 Computer Solution with Excel Solver and 2.4 Computer Solution with Solver and AMPL
2-24-07
AMPL
viii, line 13 from 4.4.1 Dual Simplex Method 4.4.1 Dual Simplex Algorithm
2-24-07
bottom
2-24-07 xii, Header line Table of Contents Contents
2-24-07 xii, line 2 from bottom 18.1.1 Necessary and Sufficient Conditions 676 18.1.1 Necessary and Sufficient Conditions 666
2-24-07 xiii, Header line Table of Contents Contents
xiii, line 4 from the References Reference
2-24-07
bottom
xiii, line 18 from the A.1 A Rudimentary AMPL Model A.1 Rudimentary AMPL Model
2-24-07
bottom
xiii, line 12 from the A.5.2 Using Print and Printf to Retrieve Output A.5.2 Using Print or Printf to Retrieve Output
2-24-07
bottom
2-24-07 xiii, line 2 from bottom Partial Solutions to Selected Problems Partial Answers to Selected Problems
xvi, line 2 from top Case 5: Optimal Ship Routing and Personnel Case 5: Optimal Ship Routing and Personnel
2-24-07
Assignments for Naval Assignment for Naval
xvi, line 7 from top Case 8: Optimization of Crosscutting and Log Case 8: Optimization of Crosscutting and Log
2-24-07
Allocation at Weyerhauser Allocation at Weyerhaeuser
xvi, line 17 from top Case 14: Analysis of Internal Transport System Case 14: Analysis of an Internal Transport System
2-24-07
in a Manufacturing Plant in a Manufacturing Plant
2-24-07 xvi, line 6 from bottom D.2.8 Matrix Manipulations with Excel D.2.8 Matrix Manipulations using Excel
xvii, lines 5/6 from Manuel Rossetti (University of Arkansas), and Heather Nachtman (University of Arkansas),
bottom Tarek Taha (JB Hunt, Inc). Manuel Rossetti (University of Arkansas), Tarek
Taha (JB Hunt, Inc), and Nabeel Yousef
(University of Central Florida).
xvii, bottom two lines HAMDY A. TAHA HAMDY A. TAHA
hat@[Link] hat@[Link]
[Link]
Back cover, col 2 The totally new Chapter 23, on the CD, The totally new Chapter 24, on the CD,
37, line 5 from top Note that x31 and x41 are in pounds and yen, Notice that x21, x31, x41, and x51 are in euro, pound,
9-5-06
yen, and KD,
2-1-07 44, line 9 from top The optimum solution is z = $64,625, x1 = 850, The optimum solution is z = $64,625, x1 = 800,
5-11-07 54, line 8 from bottom … is z =$1,428,00. … is z = $714,000.
78, end of top else does. else does. (See Section A.3 for details.)
paragraph
2-24-07 85, line 3 … The productions times are … … The production times are …
154, Example 4.1-3 Substitute x1 = x1+ - x1- Substitute x1 = x1- - x1+
5-11-07
Maximize z = 5x1+ - 5x1- + 6x2 Maximize z = 5x1- - 5x1+ + 6x2
173, TOYCO dual Minimize z = 430y1 + 460y2 + 420 y3 Minimize w = 430y1 + 460y2 + 420 y3
175, line 12 from top x1 + x2 = 2 x1 + x2 = 1
189, line 3 from bottom Example 4.5-6 Example 4.5-5
10-14-07 212, lines 10 and 14 top …in Section 5.3.4. …in Section 5.3.3.
229, two lines above …in Section 5.3.4. …in Section 5.3.3.
10-14-07
Sec. 5.5
369, line 14 from (Hint: The if-then constraint is needed to prevent (Hint: A formulation using binary xij to represent
bottom partial load shipping.) load i on trailer j is straightforward. However, you
are challenged to define xij as feet assigned to load i
in trailer j. Then use if-then constraint to prevent
partial load shipping.)
Errata, 8th 7:56:05 PM 10/13/2007 Page 2 of 2
Dates for new corrections since last update (May 11, 2007) are highlighted in red
Date Page Original text Corrected text
669, Problem 1, Set 1. *(a) f(x) =… 1. Determine the extreme points of the following
2-24-07 18.1a functions.
*(a) f(x) = …
2-24-07 718, line 8 from bottom 19.2.5 Linear Combinations Method 19.2.4 Linear Combinations Method
2-24-07 721, line 5 from top 19.2.6 SUMT Algorithm 19.2.5 SUMT Algorithm
733, line 13 from and/or) and may not be a function of the and/or). Note that nonlinearity will result if
bottom (not counting variables of the model. condition is a function of the model variables.
footnote)
762, Problem
3.5A#1(b)
C23 = 3 C24 = 6
CD23, line 9 from w2 = 0x3 + 0x4 + 48 = 48 w2 = 0x3 + 0x4 , w2* = 0
bottom
CD97, line 4 from top Case 5: Optimal Ship Routing and Personnel Case 5: Optimal Ship Routing and Personnel
2-24-07 Assignment for Navel Recruitment in Thailand Assignment for Naval Recruitment in Thailand
CD97 and CD99, Case 5: Optimal Ship Routing and Personnel Case 5: Optimal Ship Routing and Personnel
2-24-07
header line Assignment for Navel Recruitment in Thailand Assignment for Naval Recruitment in Thailand
CD118, Line 19 Case 9: Layout Planning of a Computer Case 9: Layout Planning for a Computer Integrated
2-24-07
Integrated Manufacturing (CIM) Facility Manufacturing (CIM) Facility
CD file model [Link]; (press Return to execute model [Link]; (press Return to execute [Link])
[Link] [Link]) reset; model [Link]; (press Return to execute
[Link] reset; model reset [Link]; (press Return to [Link])
in folder AmplSystem execute [Link])
CD file maximize z: sum{i in 1..2}sum{j in maximize z: sum{j in 1..3}p[j]*y[j];
5-11-07 ChapterFiles/ch2files/ 1..3}p[j]*y[j];
[Link]