Operations Research Study guides
4 Operations Research topics with plain explanations and practice questions. Free on BASMAGLY.
Operations Research
Operations research uses mathematical models to make the best decision under limited resources such as time, money, machines or materials. This course page covers the standard exam topics: formulating a linear program and solving it graphically, the simplex method with slack variables and tableaus, and the two classic network-style problems, transportation and assignment. Each guide lists the steps in order and ends with a small worked example whose numbers you can verify by hand.
Linear Programming
- Linear Programming: Formulation and the Graphical Method
Linear programming picks the best value of a linear objective under linear limits. Learn to define variables, write constraints, draw the feasible region and test corner points.- Define variables, objective, constraints, non-negativity.
- Feasible region = intersection of all constraints.
- Optimum is at a corner point of the feasible region.
- Parallel objective gives multiple optima.
- Unbounded and infeasible are the special cases.
- Simplex Method: Steps, Slack Variables and the Tableau
The simplex method solves LPs with many variables by moving between corner points. Learn slack variables, the pivot column and row rules, and the optimality test.- Add slack variables to turn <= into equations.
- Entering variable: most negative objective-row entry.
- Leaving variable: minimum ratio (RHS / positive pivot-column entry).
- Stop when the objective row has no negative entries.
- Big M or two-phase handles >= and = constraints.
Transportation and Assignment
- Transportation Problem: Northwest Corner, Least Cost and Vogel
The transportation problem ships goods from sources to destinations at minimum cost. Learn balancing, the three starting methods and how to check optimality.- Balance the problem with a dummy source or destination.
- Northwest corner ignores cost. Least cost and Vogel use cost.
- Vogel uses row and column penalties and is usually closest to optimal.
- Basic solution has m + n - 1 allocations.
- MODI: optimal when all cij - ui - vj are non-negative.
- Assignment Problem: The Hungarian Method Step by Step
The assignment problem pairs workers to jobs at minimum total cost. Learn the Hungarian method: row and column reduction, covering zeros and the final assignment.- Square matrix needed, add dummy rows or columns if not.
- Row reduction then column reduction.
- Minimum covering lines = n means optimal.
- Otherwise adjust with the smallest uncovered value.
- Maximization: subtract entries from the largest value first.
BASMAGLY is an independent student project, not an official Delta University site. Check lectures and your instructor for the final word.