Professional Documents
Culture Documents
Discover theDiscover
world at the
Leiden
world
University
at Leiden University
Introduction to O.R.
• It is originated in Britain where a team of scientists made maximum use of limited military resources
via quantitative techniques.
• It leads to the optimal solution of the problem which is close to the real solution.
• It is the most effective means in resolving complex problems efficiently (LP, Simulation, Queuing
theory…)
• OR is an analytical method of decision making that is useful in the management of organization such
as businesses and networks of machines.
Examples of machine networks: computer networks, distributed systems, Internet of Things (IoT)
- Simulation
Decision variables:
• x = # of croissants
• y = # of muffins
We call this a program. It is a linear program, because the objective is a linear function of the
decision variables, and the constraints are linear inequalities (in the decision variables).
• We maximize / minimize a linear function of the decision variables. This function is known as
objective function.
• The values of the decision variables must satisfy a set of constraints, each consisting of a linear
equation or linear inequality
Max 2𝑥1 + 𝑥2
Constraint to
3𝑥1 − 𝑥2 ≥ 6
2𝑥1 + 3𝑥2 ≤ 12
𝑥1 , 𝑥2 ≥ 0
Max 2𝑥1 + 𝑥2
Constraint to
3𝑥1 − 𝑥2 ≥ 6
2𝑥1 + 3𝑥2 ≤ 12
𝑥1 , 𝑥2 ≥ 0
Each point in the shaded feasible region satisfies all four inequality constraints is called
feasible solution.
Max 2𝑥1 + 𝑥2
Constraint to
3𝑥1 − 𝑥2 ≥ 6
2𝑥1 + 3𝑥2 ≤ 12
𝑥1 , 𝑥2 ≥ 0
The optimal solution is the feasible solution for which the objective function is largest.
2𝑥1 + 𝑥2 = 0,
2𝑥1 + 𝑥2 = 4,
2𝑥1 + 𝑥2 = 12 𝑒𝑡𝑐.