MAS632 - Lecture 1
MAS632 - Lecture 1
1
Management Science vs. O.R.
Management Science is a very broad term that
includes many aspects of the science of managing
a business
What is a model?
A simplified representation of a real-life object,
phenomenon, situation, etc.
Ex: a map, a miniature, a set of math formulas
4
Benefits of Modeling
Insight and understanding
Models give us insight into complicated problems
thereby improving decision making
Economy
It is less costly to analyze decisions using models
than in a real-world experiment
Timeliness
Models deliver needed information more quickly
than their real-world counterparts
Feasibility
Models can be used to test extreme conditions or
situations that rarely occur in the real world
5
Why Should You Care?
6
Some Success Stories
Created a vehicle routing and scheduling system to
run its delivery and home service fleets more
efficiently. Savings: $42M per year
9
A Sample of Mathematical Models
Y = log(X1 + X2 * X3)
10 5
z = åå aij xij
i =1 j =1
10
The Problem Solving Process
unsatisfactory
results
11
Main Messages
A decision model is a tool, not a substitute for the
human decision maker
12
SCHOOL OF BUSINESS ADMINISTRATION
MANAGEMENT SCIENCE DEPARTMENT
Introduction to Optimization
and Linear Programming
13
Introduction to Optimization
We all face decisions about how to use or
allocate limited resources such as:
Oil in the earth
Land for dumps
Time
Money
Workers
Applications of optimization:
Determining Product Mix
Manufacturing and SCM
Transportation, Routing and Logistics
Portfolio design
Sports scheduling
Etc.
15
Optimization Problems
Characteristics of optimization problems
Decisions
Variables under management (your) control that
can impact the performance metric
Constraints
Imposed by resource limits
Imposed by the structure of the problem
Objectives
Goal of the optimization problem
Maximize or Minimize performance metric
16
General Form of Optimization Problem
Max (or Min): f0(X1, X2, …, Xn) Objective
Subject to: f1(X1, X2, …, Xn)<=b1
: Decision
fk(X1, X2, …, Xn)>=bk Variables
:
fm(X1, X2, …, Xn)=bm Constraints
17
Linear Programming (LP) Problems
Max (or Min): c1X1 + c2X2 + … + cnXn
Subject to: a11X1 + a12X2 + … + a1nXn <= b1
:
ak1X1 + ak2X2 + … + aknXn >=bk
:
am1X1 + am2X2 + … + amnXn = bm
18
Example: A Farmer’s decision problem
A farmer owns 60 acres of land where she may
plant wheat and corn
An acre planted with wheat yields $200 profit
An acre planted with corn yields $300
Planted acres use fertilizer and labor as follows
Wheat Corn
Labor (workers) 3 2
Fertilizer (tons) 2 4
20
The Farmer’s Problem
W = # acres to plant with wheat
C = # acres to plant with corn
21
22
Solving LP Problems: Graphical Approach
24
Special Conditions in LP Models
25
Ex: Alternative Optimal Solutions
X2
250
150
100
0
0 50 100 150 200 250 X1
26
Ex: Redundant Constraint
X2
250
boundary line of constraint 1
200
boundary line of constraint 3
150
Feasible Region
50
0
0 50 100 150 200 250 X1
27
Ex: Unbounded Solution (max problem)
X2
800
objective function
X1 + X2 = 800
600
400
200
X1 + X2 = 400
0
0 200 400 600 800 1000 X1
28
Ex: Infeasibility
X2
250
200
100
feasible region
50 for constraint
X1 + X2 <= 150
0
0 50 100 150 200 250 X1
29
The Diet Problem
Suppose we have several foods, each with
nutritional content as follows
food A C B1 $/serving
beef 60 20 40 4.00
chicken 80 0 20 2.40
spaghetti 25 40 25 3.00
turkey 60 20 15 2.50
31
Another Example
Blue Ridge Hot Tubs produces two types
of hot tubs: Aqua-Spas & Hydro-Luxes.
Aqua-Spa Hydro-Lux
Pumps 1 1
Labor 9 hours 6 hours
Tubing 12 feet 16 feet
Unit Profit $350 $300
33