Preface |
|
xi | |
Author |
|
xiii | |
Chapter 1 Operations Research: An Introduction |
|
1 | (18) |
|
|
1 | (2) |
|
|
2 | (1) |
|
1.2 Decision-Making Process in OR |
|
|
3 | (1) |
|
1.2.1 Problem Formulation |
|
|
3 | (1) |
|
|
4 | (1) |
|
|
4 | (4) |
|
|
5 | (3) |
|
|
8 | (1) |
|
1.5 Unconstrained Optimization |
|
|
9 | (6) |
|
1.5.1 Case 1: University Press |
|
|
9 | (3) |
|
1.5.1.1 Problem Formulation |
|
|
9 | (1) |
|
1.5.1.2 Model Development |
|
|
9 | (2) |
|
|
11 | (1) |
|
|
12 | (11) |
|
1.5.2.1 Problem Formulation |
|
|
12 | (1) |
|
1.5.2.2 Model Development |
|
|
12 | (1) |
|
|
13 | (2) |
|
|
15 | (1) |
|
1.7 Case: Suzuki Motor Corporation |
|
|
16 | (1) |
|
|
17 | (1) |
|
|
17 | (2) |
Chapter 2 Linear Programming |
|
19 | (48) |
|
|
19 | (1) |
|
2.2 Meaning of Linear Programming (LP) |
|
|
19 | (1) |
|
|
20 | (3) |
|
|
23 | (18) |
|
|
23 | (2) |
|
|
25 | (2) |
|
|
27 | (2) |
|
2.4.4 Product-Mix Problem |
|
|
29 | (1) |
|
|
30 | (3) |
|
2.4.6 Make or Buy Problem |
|
|
33 | (2) |
|
|
35 | (2) |
|
|
37 | (2) |
|
2.4.9 Workforce Assignment |
|
|
39 | (2) |
|
|
41 | (15) |
|
2.5.1 Illustration of Maximization: Adidas AG Retail Stores |
|
|
41 | (8) |
|
2.5.2 Illustration of Minimization: Rose's Luxury Restaurant |
|
|
49 | (7) |
|
|
56 | (1) |
|
2.7 Case 1: Federal Mogul Corporation |
|
|
57 | (1) |
|
2.8 Case 2: Toyota Motors |
|
|
58 | (1) |
|
|
58 | (1) |
|
|
59 | (8) |
Chapter 3 Linear Programming: Simplex Method |
|
67 | (58) |
|
|
67 | (1) |
|
3.2 Illustration of Maximization |
|
|
67 | (15) |
|
3.2.1 Case: Woodland Biomass Power (US) |
|
|
67 | (10) |
|
|
68 | (9) |
|
3.2.2 Case: Adidas AG Retail Stores |
|
|
77 | (5) |
|
|
78 | (4) |
|
3.3 An Illustration of Minimization |
|
|
82 | (19) |
|
3.3.1 Case: Federal-Mogul |
|
|
82 | (14) |
|
|
84 | (12) |
|
3.3.2 Case: Rose's Luxury Restaurant |
|
|
96 | (5) |
|
|
97 | (4) |
|
3.4 Illustration of Maximization Problem with Greater Than Equal to Constraints |
|
|
101 | (6) |
|
|
102 | (5) |
|
3.5 Special Versions of LPP Solved by Simplex Method |
|
|
107 | (10) |
|
|
107 | (3) |
|
|
110 | (1) |
|
|
111 | (2) |
|
3.5.4 Multiple Optimal Solutions |
|
|
113 | (4) |
|
|
117 | (1) |
|
3.7 Case Study: Johnson Controls |
|
|
118 | (2) |
|
|
120 | (1) |
|
|
120 | (5) |
Chapter 4 Sensitivity Analysis and Duality Theory |
|
125 | (54) |
|
|
125 | (1) |
|
4.2 Fundamental Nature of Sensitivity Analysis |
|
|
126 | (3) |
|
4.3 Applying Sensitivity Analysis |
|
|
129 | (15) |
|
4.3.1 Change in Right Hand Side (RHS) Values of Constraint Functions (bi) |
|
|
129 | (3) |
|
4.3.2 Allowable Range of RHS Values (bi) |
|
|
132 | (2) |
|
4.3.3 Change in Objective Function Coefficient (Non-basic Variable) |
|
|
134 | (3) |
|
4.3.4 Change in Objective Function Coefficient (Basic Variable) |
|
|
137 | (7) |
|
|
144 | (20) |
|
4.4.1 Construction of Dual Problem |
|
|
144 | (2) |
|
4.4.2 Relationship between Primal and Dual Problem |
|
|
146 | (2) |
|
4.4.3 Dual Problem of Standard LPP |
|
|
148 | (7) |
|
4.4.4 Dual Problem of Non-standard LPP |
|
|
155 | (9) |
|
|
164 | (10) |
|
4.5.1 Illustration of Sensitivity Analysis |
|
|
164 | (7) |
|
4.5.2 Illustration of Duality |
|
|
171 | (3) |
|
|
174 | (1) |
|
4.7 Case Study: Modern Foods India Limited |
|
|
174 | (2) |
|
|
176 | (1) |
|
|
176 | (3) |
Chapter 5 Network Model I: Transportation Model |
|
179 | (54) |
|
|
179 | (1) |
|
5.2 Structure of Transportation Model |
|
|
180 | (2) |
|
5.3 Assumptions of Transportation Problems |
|
|
182 | (1) |
|
5.4 Transportation Problem |
|
|
182 | (3) |
|
5.4.1 Case: Musashi Auto Parts Michigan, Inc |
|
|
182 | (3) |
|
5.5 Transportation Solution Methods |
|
|
185 | (13) |
|
5.5.1 Formulation of Model |
|
|
185 | (1) |
|
|
186 | (5) |
|
5.5.2.1 Least Cost Method |
|
|
186 | (2) |
|
5.5.2.2 North-West Corner Method |
|
|
188 | (1) |
|
5.5.2.3 Vogel's Approximation Method (VAM) |
|
|
189 | (2) |
|
|
191 | (7) |
|
5.6 Unbalanced Transportation Model |
|
|
198 | (8) |
|
5.6.1 Scenario 1: Supply is More than Demand |
|
|
198 | (3) |
|
5.6.2 Scenario 2: Demand is More than Supply |
|
|
201 | (5) |
|
|
206 | (3) |
|
5.7.1 Scenario 1: With an a11 New Basic Variable |
|
|
207 | (1) |
|
5.7.2 Scenario 2: With an a23 New Basic Variable |
|
|
207 | (2) |
|
|
209 | (7) |
|
5.8.1 Linear Programming Formulation |
|
|
215 | (1) |
|
|
216 | (5) |
|
5.10 Transshipment Problem: Theory |
|
|
221 | (5) |
|
5.10.1 Case: Food Corporation of India |
|
|
221 | (5) |
|
|
226 | (1) |
|
5.12 Case Study 1: Norland Plastics Co. |
|
|
227 | (1) |
|
5.13 Case Study 2: Honda Motors |
|
|
227 | (1) |
|
|
228 | (1) |
|
|
229 | (4) |
Chapter 6 Network Model II: Assignment Model |
|
233 | (48) |
|
|
233 | (1) |
|
6.2 Assignment Problem: Construction of Model |
|
|
234 | (2) |
|
6.2.1 Case: MarketOne International LLP |
|
|
234 | (2) |
|
|
236 | (1) |
|
6.4 Comparison with Transportation Model |
|
|
237 | (1) |
|
|
238 | (6) |
|
6.6 Variations of Assignment Problem |
|
|
244 | (16) |
|
6.6.1 Unbalanced Assignment Problem |
|
|
244 | (9) |
|
6.6.1.1 Case 1: Number of Employees is More than the Number of Jobs |
|
|
245 | (5) |
|
6.6.1.2 Case 2: Number of Employees is Less than Number of Jobs |
|
|
250 | (3) |
|
6.6.2 Maximization Problem |
|
|
253 | (4) |
|
6.6.3 Unacceptable Assignment |
|
|
257 | (3) |
|
|
260 | (10) |
|
6.7.1 Case: Star Airlines |
|
|
260 | (21) |
|
6.7.1.1 Case 1: Assignment of Different Types of Airplanes to Different Routes |
|
|
260 | (2) |
|
6.7.1.2 Case 2: Assignment of Crew Members to Routes |
|
|
262 | (8) |
|
|
270 | (1) |
|
6.9 Case 1: Assigning Workers to Processes |
|
|
271 | (1) |
|
6.10 Case 2: Assigning Swings to Kids |
|
|
272 | (1) |
|
|
272 | (1) |
|
|
273 | (8) |
Chapter 7 Network Model III: Travelling Salesman, Vehicle Routing and Shortest Path Problem |
|
281 | (34) |
|
|
281 | (1) |
|
7.2 Travelling Salesman Problem |
|
|
281 | (14) |
|
7.2.1 Branch and Bound Method |
|
|
286 | (9) |
|
7.3 Vehicle Routing Problem |
|
|
295 | (7) |
|
7.3.1 Clark-Wright Savings Algorithm |
|
|
298 | (4) |
|
7.4 Shortest Path Problem: Dijkstra's Algorithm |
|
|
302 | (3) |
|
|
305 | (1) |
|
|
306 | (1) |
|
7.7 Case Study: JTEKT Corporation |
|
|
307 | (3) |
|
|
310 | (5) |
Chapter 8 Project Scheduling: PERT and CPM |
|
315 | (48) |
|
|
315 | (1) |
|
|
316 | (5) |
|
8.2.1 Rules for Construction of Network Diagrams |
|
|
317 | (4) |
|
|
321 | (10) |
|
|
321 | (10) |
|
8.4 Program Evaluation and Review Technique |
|
|
331 | (7) |
|
8.4.1 Case: East Fork Roofing |
|
|
331 | (7) |
|
8.5 Crashing: Time - Cost Trade-Offs |
|
|
338 | (8) |
|
8.5.1 An Illustration of Crashing |
|
|
340 | (6) |
|
|
346 | (8) |
|
8.6.1 Resource Limited Scheduling |
|
|
347 | (4) |
|
|
351 | (3) |
|
|
354 | (1) |
|
|
354 | (1) |
|
8.9 Case Study: Polyplastics Industries India Pvt. Ltd. |
|
|
355 | (2) |
|
|
357 | (6) |
Chapter 9 Game Theory |
|
363 | (28) |
|
|
363 | (1) |
|
9.2 Characteristics of Game Theory |
|
|
364 | (1) |
|
9.3 Elements of Game Theory |
|
|
365 | (1) |
|
9.4 Solving Games: 5G Technology |
|
|
365 | (2) |
|
9.4.1 Explanation of Payoff Table |
|
|
366 | (1) |
|
9.5 Games with Saddle Point |
|
|
367 | (4) |
|
9.5.1 Principle of Dominance |
|
|
369 | (2) |
|
9.6 Games with Mixed Strategies |
|
|
371 | (2) |
|
|
373 | (6) |
|
|
373 | (2) |
|
9.7.2 Algebraic Method for 2*m Games |
|
|
375 | (1) |
|
|
376 | (2) |
|
9.7.4 Algebraic Method for m*2 Games |
|
|
378 | (1) |
|
9.8 Linear Programming Formulation |
|
|
379 | (2) |
|
|
381 | (1) |
|
|
382 | (1) |
|
9.11 Case Study: Vendor-Retailer Relationship |
|
|
383 | (1) |
|
|
384 | (7) |
Index |
|
391 | |