Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

1. INTRODUCTION TO OR
1.1 TERMINOLOGY
1.2 THE METHODOLOGY OF OR
1.3 HISTORY OF OR
2. BASIC OR CONCEPTS
3. LINEAR PROGRAMMING
3.1 FORMULATING LP
3.2.2 The Graphical Solution (Minimization)
3.2.3 The Graphical Solution (Maximization)
3.2.4 The Simplex Algorithm
3.2.6 Other Solution Cases by Simplex
3.2.7 The Big M Method
3.3 SENSITIVITY ANALYSIS
3.3.1 Reduced Cost
3.3.3 Simple Example
3.3.4 Utilizing Lindo Output for Sensitivity
3.3.5 Additional Example (Utilizing Simplex for Sensitivity)
3.4 DUALITY
3.4.1 The Dual Theorem
3.4.2 Finding the Dual of a Normal Max Problem
4. TRANSPORTATION PROBLEMS
4.1 FORMULATING TRANSPORTATION PROBLEMS
4.1.1 LP Representation
4.1.2 Powerco Example for Balanced Transportation Problem
4.1.3 Balancing an Unbalanced Transportation Problem
4.1.4 Modified Powerco Example for Excess Supply
4.1.5 Modified Powerco Example for Unmet Demand
4.2 FINDING BFS FOR TRANSPORT’N PROBLEMS
4.2.1 Northwest Corner Method
4.2.2 Minimum Cost Method
4.2.3 Vogel’s Method
4.3 THE TRANSPORTATION SIMPLEX METHOD
4.3.1 Steps of the Method
4.3.2 Solving Powerco Example by Transportation Simplex
4.4 TRANSSHIPMENT PROBLEMS
4.4.1 Steps
4.5 ASSIGNMENT PROBLEMS
4.5.1 LP Representation
4.5.2 Hungarian Method
5. INTEGER PROGRAMMING
5.1.2 Knapsack Problems
5.1.3 Fixed Charge Problems
5.1.4 Set Covering Problems
5.1.5 Either - Or Constraints
5.1.6 If - Then Constraints
5.1.7 Traveling Salesperson Problems
0 of .
Results for:
P. 1
OR

# OR

Ratings: (0)|Views: 967|Likes:

### Availability:

See more
See less

03/03/2013

pdf

text

original

Pages 4 to 45 are not shown in this preview.
Pages 49 to 93 are not shown in this preview.
Pages 97 to 98 are not shown in this preview.