Key Ideas
1What is Operations Research?. The application of mathematical methods (especially optimization and modeling) to help organizations make better decisions about resources, logistics, and scheduling.
2Linear Programming in OR. A core tool: maximizing or minimizing an objective (like cost or profit) subject to a set of linear constraints (like limited labor hours or materials).
3The Feasible Region. The set of all possible solutions that satisfy every constraint simultaneously, often visualized as a shaded region on a graph.
4Queuing Theory. The mathematical study of waiting lines, used to analyze and improve systems like customer service lines, call centers, or network traffic.
5The Transportation Problem. A classic OR problem: finding the cheapest way to ship goods from multiple suppliers to multiple destinations while meeting demand and supply limits.
Worked Examples
A factory can make at most 40 chairs and 30 tables per week due to labor limits: chairs take 2 hours, tables take 3 hours, with 100 hours available. Write the labor constraint as an inequality.
2c + 3t <= 100
A company earns $30 profit per chair and $50 profit per table. Write the objective function to maximize profit.
Maximize P = 30c + 50t
Why does the optimal solution to a linear programming problem occur at a corner of the feasible region rather than somewhere in the middle?
Because a linear objective function's extreme values always occur at the boundary/corners of a convex feasible region