Useful Links
Systems Science
Operations Research
1. Introduction to Operations Research
2. Mathematical Preliminaries
3. Linear Programming
4. Transportation and Assignment Problems
5. Network Optimization Models
6. Integer Programming
7. Nonlinear Programming
8. Dynamic Programming
9. Stochastic Processes and Markov Chains
10. Queueing Theory
11. Inventory Theory
12. Simulation
13. Decision Analysis
14. Heuristics and Metaheuristics
Transportation and Assignment Problems
The Transportation Problem
Problem Formulation and Structure
Balanced Transportation Problems
Unbalanced Transportation Problems
Initial Feasible Solution Methods
Northwest Corner Rule
Least Cost Method
Vogel's Approximation Method
Optimality Testing and Improvement
MODI Method
Stepping Stone Method
Special Cases and Variations
The Assignment Problem
Problem Formulation and Structure
Hungarian Method
Matrix Reduction Steps
Assignment Identification
Optimization Process
Variations of Assignment Problems
Maximization Problems
Unbalanced Assignment Problems
Prohibited Assignments
The Transshipment Problem
Problem Structure and Formulation
Conversion to Transportation Problem
Solution Approaches
Applications in Distribution Networks
Previous
3. Linear Programming
Go to top
Next
5. Network Optimization Models