Professional Documents
Culture Documents
Question 1: L02
A manufacturer has a maximum of 240, 360, and 180 kilograms of wood, plastic and steel available. The company produces
two products, A and B. Each unit of A requires 1, 3 and 2 kilograms of wood, plastic and steel respectively and each unit of B
requires 3, 4 and 1 kilograms of wood, plastic and steel respectively. The profit per unit of A and B is $4.00 and $6.00
respectively. Formulate this as a linear programming model using X to denote number of units produced for product A
and Y to denote number of units produced for product B.
Question 2: L02
A manufacturer produces desks and chairs. Each desk uses 5 units of wood and each chair uses 3 units of wood. Total wood
available for a month is 2200 units. Desk production requires 3 hours of labor and a chair needs 1.4 hours. Total number of
hours available per month: 1150. Each desk contributes 40 dollars to profit and each chair contributes $22. Marketing
m
er as
requires that at least 3 chairs be produced for each desk produced. Formulate this as a linear programming model using X
to denote desks produced and Y to denote number chairs produced. You need not add integer constraints.
co
eH w
Question 3: L03
o.
rs e
ou urc
Consider partial outputs shown here (from the Answer Constraints
and Sensitivity Reports) after using solver. The problem Name Cell Value Status Slack
involves maximization of profit in the “Lego exercise”.
Handles 2.00 Not Binding 2
Different numbers of pieces are used here (compared
o
Variable Cells
dollars, would the optimum production
quantities (from b) change? Explain your Final Objective Allowable Allowable
Th
1
https://www.coursehero.com/file/14449813/Practice-questions/
Question 4: L03
Consider the partial output shown from the Sensitivity report of the Solver for a transportation model.
(a) How many total supply points and demand points are there? Do not count Dummy Supply/Demand point.
List the names.
(b) Complete the solution below by drawing arrows from supply to demand point only if the shipment is non‐
zero. On each arrow, write two numbers: quantity shipped and unit shipping cost. Use circles from the top;
you need not use all circles. In square boxes, write supply / demand quantities including dummy
supply/demand. For the dummy shipment use dotted arrow.
Supply Demand
Final Objective Allowable Allowable
Name Value Coefficient Increase Decrease S1 D1
S1 D1 0 90 1E+30 60
S1 D2 210 80 20 5
S1 D3 20 50 5 20
S2 D1 300 100 50 1E+30
m
S2 D2 0 170 1E+30 20
er as
S2 D3 180 120 20 50
co
S3 D1 0 150 1E+30 105
eH w
S3 D2 150 95 5 1E+30
S3 D3 0 70 1E+30 5
o.
S4 D1
S4 D2
0
190 rs e0
0
1E+30
30
50
1E+30
ou urc
S4 D3 0 0 1E+30 30
(c) What is the total shipping cost? Show calculations using numbers written on the arrows.
o
Question 5: L03
aC s
vi y re
A resort hotel is being built in a wooded area. Eight locations are to be connected to
Node Node Distance
each other with paths. Determine the paths to be selected with minimum
1 2 150
ed d
construction length so that all locations are connected to each other.
1 3 190
ar stu
1 4 215
1 Hotel
1 5 670
2 Tennis courts
1 6 110
3 Artist colony
sh is
2 4 310
4 Spa
2 5 420
Th
5 Stables
3 4 275
6 Craft houses
3 6 150
7 Pond
5 6 320
8 Golf course
5 7 160
5 8 205
6 7 200
6 8 330
7 8 175
2
https://www.coursehero.com/file/14449813/Practice-questions/
Question 6: L04
Formulate the integer linear programming problem from the information given below.
We want to buy two types of machines (M1 and M2); use variables X1 and X2 to denote number of machines of
two types.
Objective function: Marginal daily profitability of per unit of M1 and M2 is 100 dollars and 150 dollars and you
want to maximize your daily profitability.
Resource and production constraints:
M1 costs 15000 dollars per unit and M2 costs 4000 dollars. Your budget: 140,000 dollars.
You have 200 square feet of space available. M1 needs 15 square feet per unit and M2 needs 25 square
feet per unit.
Number of machines of type M1 must be at least twice as many as type M2.
Integer and other constraints
Question 7: L04
You have 6 projects P1, P2, …, P6 represented by binary variables Y1, .., Y6 (value 0 means the project is not
selected and 1 means the project is selected). Treat each of the following questions as independent and
m
formulate constraint(s) for each – you may need 1 or more constraints to satisfy the
er as
specified condition. Each part below is independent of the other.
co
eH w
(a) Condition: Projects belong to two groups. P1, P2 and P3 to group 1; P4, P5 and P6 to group 2. Condition:
Exactly 1 project from each group must be selected.
o.
(b) Condition: Projects belong to two groups. P1, P2 and P3 to group 1; P4, P5 and P6 to group 2. Condition:
rs e
More projects must be selected from group 2 compared to group 1.
ou urc
Question 8: L04
o
Table 1 below Table 1: Calculations for the lot sizing model
aC s
Demand
calculations for the
Period 1 2 3 4 5 6 7 8 9 10
lot sizing model.
Interpret this table 1 Total cost 120.0 240.0 416.0
(by circling 2 Total cost 245.0 341.0 725.0
ed d
optimal order
7 Total cost 879.0 999.0 1395.0
quantities in the
Th
3
https://www.coursehero.com/file/14449813/Practice-questions/
Question 9: L04 Period 1 2 3 4 5
Consider the N‐period lot sizing model. Data for 5 periods is shown in the Demand 50 120 100 160 60
table. Calculate all costs for the alternative “Buy in period 1 for periods Ordering cost 130 135 140 145 150
1, 2, 3 and 4. Show your calculations and the holding cost. Unit holding cost 10 12 13 14 15
Question 10: L05
Mini‐max regret: Table 1 below shows the payoff values for 3 alternatives and 3 outcomes (states of nature).
Which alternative would you select if you use Mini‐max regret approach? Explain your steps.
Table 2: Regret table
m
er as
Table 1: Payoff table
Rates Rates Rates Rates Rates Rates
co
up static down up static down
eH w
Stocks ‐4 4 12 Stocks
o.
Bonds
rs e
‐2 3 8 Bonds
ou urc
Money M. 3 2 1 Money M.
o
A writer can sell his novel to a TV producer for $1.4 million. There are four possibilities for selling the novel to a
movie company; he can get either $1.0 million or $1.3 million or $1.8 million or $2.0 million. Suppose the T.V. offer
is certain but there are probabilities associated with the movie offer (20% for 1.0m, 30% for 1.3m, 30% for 1.8m
and 20% for 2.0m).
ed d
(a) Draw a decision tree and write payoffs at the end of each branch.
ar stu
(b) Calculate EMV and clearly state the decision based on your calculated numbers.
A company has to decide whether to expand or not.
Th
The expansion cost is $2.1 million. If the economy improves substantially (20% probability) the (projected)
revenues with expansion will be $6.0 million. If the economy turns worse (30% probability) the revenues will be
$2.0 million. With economy remaining roughly the same (50% probability), the revenues will be 4.2 million.
Without expansion, the corresponding revenues will be $3.0 million, $1.2 million and 1.9 million.
Based on decision analysis technique what decision would you recommend? Draw a decision tree and
calculate EMV. Do not forget to take into account the cost of expansion.
4
https://www.coursehero.com/file/14449813/Practice-questions/
Question 13: L06
A random number is drawn and is equal to 0.50. What value of X will be generated for the
probability distribution shown in the table?
m
CLOCK Clock
er as
Tr. No Inter‐ Service Arrive Start Finish 100
co
arrival time time
eH w
10 ‐ 9 92 94
o.
11 8 7 100
12 5
rs e 2
ou urc
13
14
o
aC s
vi y re
ed d
ar stu
sh is
Th
5
https://www.coursehero.com/file/14449813/Practice-questions/
Partial Answers:
Question 1: Question 2:
Maximize 4 X + 6 Y = Z Maximize 40 X + 22 Y = Z
Constraint names Constraint names
Wood X + 3 Y 240 Material 5X + 3 Y 2200
Plastic 3X + 4Y 360 Labor 3X + 1.4Y 1150
Steel 2X + Y 180 Production 3X ‐ Y 0
Non‐negativity X, Y 0 Non‐negativity X, Y 0
Production requirement converted from 3X Y
Question 3:
a) What is the objective function? Maximize Z = 10 X1 + 15X2 + 25X3
m
b) What are the optimal production quantities and optimal profit? Z = 125, X1 = 2, X2 = 2, X3 = 3.
er as
c) Which components are leftover (list names with leftover quantities)?
co
eH w
Handles 2 Wheels 4 Axels 2 Strips 2 1x1s 18
o.
d) Since the allowable decrease for wells is 10, reduction by 7 will not affect optimal quantities.
rs e
ou urc
So X1 = 2, X2 = 2, X3 = 3 but Z will be decrease by 7 * 3 = 21 and Z will be reduced to 104.
Question 4:
o
aC s
(a) Supply (3): S1, S2, S3. Demand (3): D1, D2, D3
vi y re
(b)
Supply Demand
230 S1 D1 300
ed d
480 S2 20, 50 D2 550
sh is
180, 120
Th
150 S3 D3 200
150, 95
190 S4 190, 0
Numbers on the arrow indicate shipping quantity and unit shipping cost.
(C) Total cost = 210*80 + 20*50 + 300*100 + 180*120 + 150*95 + 190*0 = 83,650.
6
https://www.coursehero.com/file/14449813/Practice-questions/
Question 5:
First three columns below were already filled in the question paper.
Total nodes = 8, we need to select 7 arcs.
m
er as
3 4 275 N
co
2 4 310 N
eH w
5 6 320 N
o.
6 8 330 N
2 5
rs e
420 N
ou urc
1 5 670 N
o
maximize 100 X1 + 150 X2 = Z
vi y re
constraints X1 0, X2 0
sh is
Question 8:
Period 1 2 3 4 5 6 7 8 9 10 Total cost
Th
Question 9:
P4 Explanation
Previous Best 0 No previous decision
Ordering cost 130
P1 Holding Cost 9000
Holding cost =
(120+100+160)*10
Total cost 9130 +(100+160)*12 + 160*13
7
https://www.coursehero.com/file/14449813/Practice-questions/
Question 10:
Table 1: Payoff table Table 2: Regret table
Rates Rates Rates Rates Rates Rates Maximum
up static down up static down regret
Stocks ‐4 4 12 Stocks 7 0 0 7
Bonds ‐2 3 8 Bonds 5 1 4 5
Money M. 3 2 1 Money M. 0 2 11 11
Maximum 3 4 12 Select bonds (with minimax regret) 5
m
er as
co
Payoff 1.0
eH w
o.
Movie
rs e Payoff 1.3 Select movie offer
ou urc
EMV = 0.2 * 30%
1.0 + 0.3 *
o
Payoff 1.8
1.3 + 0.3 *
aC s
1.8 + 0.2 *
vi y re
2.0 = $1.53m
Payoff 2.0
ed d
ar stu
Question 12:
Cost 2.1
sh is
Th
Payoff 6.0
B
Payoff 2.0
Payoff 4.2
A
Payoff 3.0
C
Cost 0 8
Payoff 1.2
https://www.coursehero.com/file/14449813/Practice-questions/
Payoff 1.9
Expand:
EMV = (0.2)*6 + (0.3)*2 + (0.5)*4.2 – 2.1 = 3.9 – 2.1 = $1.8 million
Do not expand:
EMV = (0.2)*3 + (0.3)*1.2 + (0.5)*1.9 – 0 = $1.91 million
Decision: Do not expand
Question 13:
Let the random number be R (has a value between 0 and 0.99999.)
For R = 0.5, select X = 400 because
If R < 0.1, X = 100.
If 0.1 R < 0.4, X = 200.
If 0.4 R < 0.5, X = 300. X 100 200 300 400 500
m
er as
If 0.5 R < .92, X = 400 Pr(X) 0.10 0.30 0.10 0.42 0.08
Cum. Prob. F(X) 0.10 0.40 0.50 0.92 0.99
co
If 0.92 R < 1.00, X =500
eH w
Question 14:
o.
rs e
ou urc
Tr. No Inter‐ Service CLOCK Clock
First add inter‐arrival and service
arrival time time Arrive Start Finish 100
times for #13 and $14 to the table
103
(2) (3) (4) (5) (6) 105
(columns 2 and 3).
o
12 5 2 117
transaction inter‐arrival time.
119
13 8 6 113 113 119 127
14 4 8 117 119 127
ed d
Complete the finish time for the current transaction number 10 (column 6). Update the clock to next event
ar stu
(finish and release of transaction 10). Complete the start, finish times for #11. Update clock and continue.
sh is
Th
9
https://www.coursehero.com/file/14449813/Practice-questions/