Chapter 1 Problem Solving with Mathematical Models
description
Transcript of Chapter 1 Problem Solving with Mathematical Models
![Page 1: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/1.jpg)
Chapter 1
Problem Solvingwith Mathematical Models
![Page 2: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/2.jpg)
Mathematical Model
– A mathematical model is the collection of variables and relationships needed to describe pertinent features of such a problem.
Operations Research (OR) [1.1]– Is the study of how to form mathematical models of
complex engineering and management problems and how to analyze them to gain insight about possible solutions.
![Page 3: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/3.jpg)
EXAMPLE 1.1: Mortimer Middleman
Mortimer Middleman--friends call him MM--operates a modest wholesale diamond business. Several times each year MM travels to Antwerp, Belgium, to replenish his diamond supply on the international market. The wholesale price there averages approximately $700 per carat, but Antwerp market rules require him to buy at least 100 carats each trip. Mortimer and his staff then resell the diamonds to jewelers at a profit of $200 per carat. Each of the Antwerp trips requires 1 week, including the time for Mortimer to get ready, and costs approximately $2000.
![Page 4: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/4.jpg)
EXAMPLE 1.1: Mortimer Middleman
Customer demand values in Figure 1.1(a) show that business has been good. Over the past year, customers have come in to order an average of 55 carats per week.
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 510
20
40
60
80
100
120
Demand
![Page 5: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/5.jpg)
EXAMPLE 1.1: Mortimer Middleman
Part (c) of Figure 1.1 illustrates Mortimer’s problem. Weekly levels of on-hand diamond inventory have varied widely, [Figure 1.1(c)]
1 2 3 4 5 6 7 8 9 101112131415161718192021222324252627282930313233343536373839404142434445464748495051520
50
100
150
200
250
300
350
400
450
500
![Page 6: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/6.jpg)
EXAMPLE 1.1: Mortimer Middleman
depending on the ups and downs in sales and the pattern of MM’s replenishment trips [Figure 1.1(b)].
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 510
50
100
150
200
250
300
350
400
450
Repl.
![Page 7: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/7.jpg)
EXAMPLE 1.1: Mortimer Middleman
Sometimes Mortimer believes that he is holding too much inventory. The hundreds of carats of diamonds on hand during some weeks add to his insurance costs and tie up capital that he could otherwise invest. MM has estimated that these holding costs total 0.5 % of wholesale value per week (i.e., 0.005 x $700 = $3.50 per carat per week).
At other times, diamond sales—and Mortimer’s $200 per carat profit—have been lost because customer demand exceeded available stock [see Figure 1.1(d)]. When a customer calls, MM must either fill the order on the spot or lose the sale.
![Page 8: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/8.jpg)
EXAMPLE 1.1: Mortimer Middleman
1 2 3 4 5 6 7 8 9 101112131415161718192021222324252627282930313233343536373839404142434445464748495051520
5
10
15
20
25
30
35
40
45
50
Lost_sales
[Figure 1.1(d)].
![Page 9: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/9.jpg)
EXAMPLE 1.1: Mortimer Middleman
Adding this all up for the past year, MM estimates holding costs of $38,409, unrealized profits from lost sales of $31,600, and resupply travel costs of $24,000, making the annual total $94,009. Can he do better?
![Page 10: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/10.jpg)
1.2 Optimization and the Operations Research Process
Problem
Model
Conclusions
Decisions
Modeling
AnalysisInference
Assessment
![Page 11: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/11.jpg)
3 Dimension of the Problem
• The decisions open to the decision makers
• The constraints limiting decision choices• The objectives making some decisions
preferred to others [1.2]
![Page 12: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/12.jpg)
EXAMPLE 1.1: Mortimer Middleman
• Decisions: reorder point, order quantity• Constraints: non-negative, order quantity > 100• Objectives: to minimize total cost (holding +
replenishment + lost-sale)
![Page 13: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/13.jpg)
Optimization and Mathematical Programming
• Optimization models (also called mathematical Programs) represent problem choices as decision variables and seek values that maximize or minimize objective functions of the decision variables subject to constraints on variable values expressing the limits on possible decision choices. [1.3]
![Page 14: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/14.jpg)
EXAMPLE 1.1: Mortimer Middleman
• Decision Variables: q reorder quantityr reorder point( means “is defined to be”)
• Constraints: q 100r 0
• Objective function:c(q, r) total cost using a reorder quantity of q and a reorder point r
![Page 15: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/15.jpg)
Constant-Rate Demand Assumption
• Assume constant-rate demand of 55 carats/wk1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51
0
20
40
60
80
100
120Demand
![Page 16: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/16.jpg)
Inventory with safety stock
Inventory
Time
q
r
l
safety stock
slope=d
q/d
![Page 17: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/17.jpg)
Inventory without safety stockor lost sales
Inventory
Time
q
r
l
slope=d
q/d
![Page 18: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/18.jpg)
Inventory with lost sales
Inventory
Time
qr
l
slope=d
q/d
Lost sales
![Page 19: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/19.jpg)
EXAMPLE 1.1: Constant-Rate Demand Model
Minimize (1.1)
Subject to q 100r 55
![Page 20: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/20.jpg)
Feasible and Optimal Solutions
• A feasible solution is a choice of values for the decision variables that satisfies all constraints. (e.g. q=200, r=90)
• Optimal solutions are feasible solutions that achieve objective function value(s) as good as those of any other feasible solutions. [1.4]
![Page 21: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/21.jpg)
EXAMPLE 1.1: Constant-Rate Demand Model
r* = 55(1.2)
q =
![Page 22: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/22.jpg)
EXAMPLE 1.1: Constant-Rate Demand Model
100
120
140
160
180
200
220
240
260
280
300
320
340
360
380
400
420
$-
$200.00
$400.00
$600.00
$800.00
$1,000.00
$1,200.00
$1,400.00
TC2
![Page 23: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/23.jpg)
1.3 System Boundaries, Sensitivity Analysis, Tractability, and Validity
Output variablesModeling and Analysis in the
decision variables
System boundary
Parameters
![Page 24: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/24.jpg)
EOQ Under Constant-Rate Demand
• Parameters: d weekly demand (55 carats)f fixed cost of replenishment ($2000)h cost per carat per wk for holding inventory
($3.50)s cost per carat of lost sales ($200)l lead time between reaching the reorder
point and receiving a new supply (1 week)m minimum order size (100 carats)
![Page 25: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/25.jpg)
EOQ Under Constant-Rate Demand
• Decision variables (if lost sales are not allowed): [1.5]
optimal order quantity q* = optimal reorder point r* =
• Provided q* m• q*
![Page 26: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/26.jpg)
Sensitivity Analysis
• Sensitivity analysis is an exploration of results from mathematical models to evaluate how they depend on the values chosen for parameters. [1.6]
![Page 27: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/27.jpg)
Sensitivity Analysis
100
120
140
160
180
200
220
240
260
280
300
320
340
360
380
400
420
$-
$200.00
$400.00
$600.00
$800.00
$1,000.00
$1,200.00
$1,400.00
$1,600.00
$1,800.00
$2,000.00
f=$3000
f=$2000
f=$1000
![Page 28: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/28.jpg)
Closed-Form Solutions
• Closed-form solutions represent the ultimate in analysis of mathematical models because they provide both immediate results and rich sensibility analysis. [1.7]
![Page 29: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/29.jpg)
Tractability versus Validity
• Tractability in modeling means the degree to which the model admits convenient analysis – how much analysis is practical. [1.8]
• Validity of a model is the degree to which inference drawn from the model hold for the real system. [1.9]
• OR analysts almost always confront a tradeoff between validity of models and their tractability to analysis. [1.10]
![Page 30: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/30.jpg)
1.4 Descriptive Models and Simulation
• A simulation model is a computer program that simply steps through the behavior of a system of interest and reports experience.
![Page 31: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/31.jpg)
Simulation over MM’s History
1 2 3 4 5 6 7 8 9 101112131415161718192021222324252627282930313233343536373839404142434445464748495051520
50
100
150
200
250
300Repl.
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 510
10203040506070
Lost_sales
![Page 32: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/32.jpg)
Simulation over MM’s History
1 2 3 4 5 6 7 8 9 101112131415161718192021222324252627282930313233343536373839404142434445464748495051520
50
100
150
200
250
300Inventory Level
Total Cost: $108,729.75
![Page 33: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/33.jpg)
Simulation Model Validity
• Simulation models often possess high validity because they track true system behavior fairly accurately.
![Page 34: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/34.jpg)
Descriptive versus Prescriptive Models
• Descriptive Models evaluate fixed decision alternatives rather than indicating good choices.
• Descriptive Models yield fewer analytical inferences than prescriptive, optimization models because they take both input parameters and decisions as fixed.
![Page 35: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/35.jpg)
1.5 Numerical Search andExact versus Heuristic Solutions
c(q,r) total cost computed by simulation with reorder point fixed at r and reorder quantity at q
MM’s problem than reduces to the math model:
minimize c(q,r) (1.3)subject to q 100, r 0
![Page 36: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/36.jpg)
Numerical Search
• Numerical search is the process of systematically trying different choices for the decision variables, keeping track of the feasible one with the best objective function value found so far.
![Page 37: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/37.jpg)
Numerical Search
q(0) = 251, r(0) = 55, c(q(0), r(0)) = $108,621q(1) = 251, r(1) = 65, c(q(1), r(1)) = $108,421 q(2) = 251, r(2) = 75, c(q(2), r(2)) = $63,254 q(3) = 251, r(3) = 85, c(q(3), r(3)) = $63,054 q(4) = 251, r(4) = 95, c(q(4), r(4)) = $64,242 increasing qq(5) = 261, r(5) = 85, c(q(5), r(5)) = $95,193
decreading qq(6) = 241, r(6) = 85, c(q(6), r(6)) = $72,781
STOPq(3) = 251, r(3) = 85, c(q(3), r(3)) = $63,054
![Page 38: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/38.jpg)
Numerical Search – A Different Start
q(0) = 251, r(0) = 145, c(q(0), r(0)) = $56,904q(1) = 251, r(1) = 155, c(q(1), r(1)) = $59,539
decreading rq(2) = 251, r(2) = 135, c(q(2), r(2)) = $56,900 q(3) = 251, r(3) = 125, c(q(3), r(3)) = $59,732
increasing qq(4) = 261, r(4) = 135, c(q(4), r(4)) = $54,193 q(5) = 271, r(5) = 135, c(q(5), r(5)) = $58,467 STOPq(4) = 261, r(4) = 135, c(q(4), r(4)) = $54,193
![Page 39: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/39.jpg)
Numerical Search
• Inferences from numerical search are limited to specific points explored unless mathematical structure in the model supports further deduction. [1.13]
![Page 40: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/40.jpg)
Exact versus Heuristic Optimization
• An exact optimal solution is a feasible solution to an optimization model that is provably as good as any other in objective function value.
• A heuristic or approximate optimum is a feasible solution derived from perspective analysis that is not guaranteed to yield an exact optimum. [1.14]
• Losses from settling for heuristic instead of exact optimal solutions are often dwarfed by variations associated with questionable model assumptions and doubtful data. [1.15]
• The appeal of exact optimal solutions is that they provide both good feasible solutions and certainty about what can be achieved under a fixed set of model assumptions. [1.16]
![Page 41: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/41.jpg)
1.6 Deterministic versus Stochastic Models
• A mathematical model is termed deterministic if all parameter values are assumed to be known with certainty, and probabilistic or stochastic if it involves quantities known only in probability. [1.17]
![Page 42: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/42.jpg)
Random Variables and Realizations
• Random variables (in Caps) represent quantities known only in terms of a probability in stochastic models.
10 20 30 40 50 60 70 80 900
2
4
6
8
10
12
14
16
Frequency
![Page 43: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/43.jpg)
Stochastic Simulation(Monte Carlo Analysis)
1. Randomly generating a sequence of realizations for input parameters.
2. Simulating each realization against chosen values for the decision variables.
• Besides providing only descriptive analysis, stochastic simulation models impose the extra analytic burden of having to estimate results statistically from a sample of system realizations. [1.18]
![Page 44: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/44.jpg)
Tradeoffs between Deterministic and Stochastic Models
• The power and generality of available mathematical tools for analysis of stochastic models does not nearly match that available for deterministic models. [1.19]
• Most optimization models are deterministic – not because OR analysts really believe that all problem parameters are known with certainty, but because useful prescriptive results can often be obtained only if stochastic variation is ignored. [1.20]
![Page 45: Chapter 1 Problem Solving with Mathematical Models](https://reader036.fdocuments.net/reader036/viewer/2022081420/568160d0550346895dd0053c/html5/thumbnails/45.jpg)
1.7 Perspectives
• Informal <> Formal models• Validity <> Tractability• Other considerations: understood, time frame,
computer power, data collection…• The model-based OR approach to problem solving
works best on problems important enough to warrant the time and resources for a careful study. [1.21]