3330 Final Fall 2010 MCQ + Solutions

AP/ADMS 3330.3.
0 Fall 2010 Final Exam Part 1
PART I (1 mark each; total = 50 marks)
MULTIPLE CHOICE. Choose the letter corresponding to the one alternative that best
completes the statement or answers the question.
1. An integer programming (minimization) problem was first solved as a LP relaxation problem,

and the objective function value (cost) was $253.67. The two decision variables (X, Y) in
the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal solution,
which of the following must be true for the optimal integer solution to this problem?
A. X = 13 Y = 33
B. X = 12 Y = 32
C. the objective function value must be less than $253.67
D. the objective function value will be greater than $253.67
E. none of the above
Chapter 11:
The solution to an LP relaxation problem is always better or equal to its corresponding
integer programming solution.
For a minimization problem, the OFV* for the integer problem will be greater or
equal to the corresponding OFV for the LP relaxation problem.
For a maximization problem, the OFV for the integer problem will be less or equal to
the corresponding OFV for the LP relaxation problem.
*OFV = Objective Function Value
2. A negative dual price for a constraint in a minimization problem means

A. as the right-hand side increases, the objective function value will increase.
B. as the right-hand side decreases, the objective function value will increase.
C. as the right-hand side increases, the objective function value will decrease.
D. as the right-hand side decreases, the objective function value will decrease.
Chapter 7,8:
The dual price is the improvement in the value of the OFV per unit increase in the
right-hand side of a constraint.
A negative dual price connotes a worsening of the OFV per unit increase in the right-
hand side of a constraint.
A negative dual price in a maximization problem implies that as the right-hand side
increases, the objective function (e.g. profit) value will decrease.
A negative dual price in a minimization problem implies that as the right-hand side
increases, the objective function (e.g. cost) value will increase.
Note that option D is also correct.
1 of 22
solved by stats1easy.com
AP/ADMS 3330.3.0 Fall 2010 Final Exam Part 1
3. In a minimization problem, when one or more of the solution variables and the cost can be
made infinitely large without violating any constraints, then the linear program has
A. an infeasible solution.
B. an unbounded solution.
C. a redundant constraint.
D. alternate optimal solutions.
Chapter 7 (7.6 special cases)

Note that unbounded solution only applies to maximization problems.
4. The amount by which an objective function coefficient would have to improve before it would
be possible for the corresponding variable to assume a positive value in the optimal solution
is called the
A. best cost.
B. relevant cost.
Chapter 8
C. sunk cost.
D. dual price. The correct answer is Reduced Cost.
E. None of the above
5. Which of the following statement is false?

A. When the right-hand sides of two constraints are each increased by one unit, the
objective function value will be adjusted by the sum of the constraints dual
prices.
B. If the range of feasibility indicates that the original amount of a resource, which
was 20, can increase by 5, then the amount of the resource can increase to 25.
C. The 100% Rule does not imply that the optimal solution will necessarily change if
the percentage exceeds 100%.
D. For any constraint, either its slack/surplus value must be zero or its dual price
must be zero.
E. A negative dual price indicates that increasing the right-hand side of the
associated constraint would be detrimental to the objective
Chapter 8 (Simultaneous changes)

When simultaneous changes are made, we need to first ensure that the
total percent of allowable changes are within 100% before drawing
conclusions/making adjustments.
2 of 22
6. According to Table below, the time between successive arrivals is 1, 2, 3, or 4 minutes. The
store opens at 8:00a.m., and random numbers are used to generate arrivals and service times.
The first two random numbers for arrivals are 95 and 08. The first two random numbers for
service times are 92 and 18. At what time does the second customer finish transacting
business?
Time Between Arrivals Probability

(minutes)
1 0.1
2 0.3
3 0.4
4 0.2
Service Time (minutes) Probability

1 0.2
2 0.4
3 0.3
4 0.1
A. 8:07
B. 8:08
C. 8:09
D. 8:10
Chapter 15
Time
Service
Between Random Random
Prob. Time Prob.
Arrivals Number Number
(minutes)
(minutes) Cumulative Interval Cumulative Interval
1 0.1 0.1 00 to 09 1 0.2 0.2 00 to 19
2 0.3 0.4 10 to 39 2 0.4 0.6 20 to 59
3 0.4 0.8 40 to 79 3 0.3 0.9 60 to 89
4 0.2 1 80 to 99 4 0.1 1 90 to 99
Inter Comple
Arrival Service Waiting ServiceT
Arrival RN Arrival RN tion
Time Start time Time ime
Time Time
1 95 4 4 4 0 92 4 8
2 08 1 5 8 3 18 1 9
OR
Inter Comple
Arrival Service Waiting Service
Arrival RN Arrival RN tion
Time Start time Time Time
Time Time
1 95 4 8:04 8:04 0 92 4 8:08
2 08 1 8:05 8:08 3 18 1 8:09
3 of 22
7. Consider the following linear programming problem:
Maximize 12X + 10Y

Subject to: 4X + 3Y 480
2X + 3Y 360
all variables 0
The maximum possible value for the objective function is

A. 360.
B. 480.
C. 1520.
D. 1560.
4 of 22
8. In a 0-1 integer programming model, if the constraint x1-x2 = 0 is specified, it means

when project 1 is selected, project 2 __________________ be selected.
A. must also
B. can sometimes
C. can never
D. can also
Chapter 11 (11.4 0-1 integer variables)

= =
These are requisite variables. In essence, if x1 is selected, x2 must also be
and vice versa.
9. The solution to the linear programming relaxation of an integer programming

minimization problem will always be __________ the value of the IP problem.
A. greater than or equal to

B. less than or equal to
C. equal to
D. different from
Chapter 11:
The solution to an LP relaxation problem is always better or equal to its corresponding
integer programming solution.
For a minimization problem, the OFV* for the integer problem will be greater or
equal to the corresponding OFV for the LP relaxation problem.
For a maximization problem, the OFV for the integer problem will be less or equal to
the corresponding OFV for the LP relaxation problem.
*OFV = Objective Function Value
10. The constraint x14 + x24 + x47 x48 = 0, may be a constraint associated with a
_______________ node.
A. source
B. transshipment
C. destination
D. any of the above
Chapter 10:
This is a transshipment node constraint. 14 + 24 = 47 + 48
That is, node 4 receives from nodes 1 and 4 and supplies to nodes 7 and 8.
5 of 22
11. A rounded solution to a maximization ILP may not be feasible because
A. it violates at least one of the technical constraints

B. it violates at least one of the non-negativity constraints
C. its optimal value of objective function is smaller than the optimal value of
objective function of the LP relaxation
D. none of the above
Chapter 11:
Note that violating at least one of the non-negativity constraints (b) also makes a
solution infeasible. However, you cannot make a positive value negative by rounding.
12. Assume that we are using a 0-1 integer programming model to solve a capital budgeting
problem. Let xj = 1 if project j is selected and xj = 0, otherwise. The constraint (x1 + x2 +
x3 + x4 3) means that _____________ out of ____ projects must be selected.
A. exactly 1; 4
B. at most 3; 4
Chapter 9, 10:
C. at least 3; 4
D. at most 2; 4 = At most
13. In a ______________ integer programming model, the solution values of all the decision
variables are 0 or 1.
A. total
Chapter 11:
B. binary
C. mixed 0, 1 Binary
D. all of the above
14. Assume that a project completion time follows a normal probability distribution with a
mean of 20 days and standard deviation of 5 days. The probability that the project will
be completed within less than 22 days is approximately
A. 31.3%
Chapter 12:
B. 65.5%
C. 72.6% = 20, = 5, < 22
D. 81.3%
E. 100% 22 20
= = = 0.4
5
( < 0.4) = 0.6554
6 of 22
Questions #15 - #27
Pond Road Preschool (PRPS) is trying to decide what to feed children for Monday lunches.
PRPS would like to keep costs down, while meeting the nutritional requirements of the children.
They have already decided to go with peanut butter and jelly sandwiches, and some
combination of graham crackers, milk, and orange juice. The nutritional content of each food
choice and its cost are specified in the table below:
Calories Total Vitamin C Protein Cost

Food Item from Fat Calories (mg) (grams) (cents)
Bread (1 slice) 10 70 0 3 5.5
Peanut butter (1 tbsp) 75 100 0 4 4
Strawberry jelly (1 tbsp) 0 50 3 0 7
Graham cracker (1 piece) 20 60 0 1 10.9
Milk (1 cup) 70 150 2 8 20
Orange juice (1 cup) 0 100 120 1 35
Each child should receive between 400 and 600 calories for lunch. No more than 30% of total
calories should come from fat. Each child should get at least 60 mg of vitamin C and 12 grams
of protein. Moreover, for practical reasons, each child needs exactly 2 slices of bread (costing
10 cents) to make the sandwich, at least twice as much peanut butter as jelly, at least 1 cup of
orange juice, and at least 1.5 cups of liquid (milk and/or juice).
PRSPs administrator has defined the following decision variables, in terms of numbers of units
(as specified) for each lunch to serve on Mondays:
B = Slices of bread
P = Tablespoons of peanut butter
S = Tablespoons of strawberry jelly
G = Pieces of graham crackers
M = cups of milk
J = cups of orange juice
Using the above decision variables, an LP model has been formulated. Below is output from
the LP module of the Management Scientist v6.0 software:
MIN 5.5B+4P+7S+10.9G+20M+35J
S.T.
1) 70B+100P+50S+60G+150M+100J>400
2) 70B+100P+50S+60G+150M+100J<600
3) 3S+2M+120J>60
4) 3B+4P+1G+8M+1J>12
5) 11B-45P+15S-2G-25M+30J>0
6) 1P-2S>0
7) 1J>1
8) 1M+1J>1.5
9) 1B=2
7 of 22
OPTIMAL SOLUTION
Objective Function Value = 59.400
Variable Value Reduced Costs
-------------- --------------- ------------------
B 2.000 0.000
P 0.850 0.000
S 0.000 5.000
G 0.000 8.500
M 0.500 0.000
J 1.000 0.000
Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 0.000 -0.040
2 200.000 0.000
3 61.000 0.000
4 2.400 0.000
5 1.250 0.000
6 0.850 0.000
7 0.000 -17.000
8 0.000 -14.000
9 0.000 -2.700
OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit
------------ --------------- --------------- ---------------
B No Lower Limit 5.500 No Upper Limit
P 0.000 4.000 13.333
S 2.000 7.000 No Upper Limit
G 2.400 10.900 No Upper Limit
M 6.000 20.000 37.000
J 18.000 35.000 No Upper Limit
RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit
------------ --------------- --------------- ---------------
1 340.000 400.000 402.778
2 400.000 600.000 No Upper Limit
3 No Lower Limit 60.000 121.000
4 No Lower Limit 12.000 14.400
7 0.962 1.000 1.480
8 1.471 1.500 2.067
9 1.971 2.000 3.214
15. Which of the FIRST FOUR technical constraints will involve surplus variables when
converted to equality constraints?
Constraints that will involve surplus
A. Constraints 1, 3, and 4 variables when converted to equality
B. Constraint 2
constraints are > constraints. Of the
C. All of the first four constraints (1 through 4)
D. None of the first four constraints first 4, only 1, 3, and 4 have the > sign.
8 of 22
16. Which of the following technical constraints is/are binding at the reported optimal
solution?
A. Constraint 1
B. Constraint 3
C. Both constraint 1 and constraint 3
D. Neither constraint 1 nor constraint 3
Binding constraints have 0

slack/surplus at optimal solution
17. At the reported optimal solution, what is the total number of calories in a Monday lunch?
A. 400
B. 600
C. More than 400 but less than 600
D. More than 600
Constraints 1 & 2 are the total number of calories constraints

Method 1: Using Constraint 1

-------------- --------------- ------------------
1 0.000 -0.040
Note that the surplus* value is 0. This means that no more than 400 (the current
value) was used.
Method 2: Using Constraint 2

-------------- --------------- ------------------
2 200 0.000
Note that the slack** value is 200. This means that 200 of the available 600 was used.
That is, amount used = 600 200 = 400.
* slack variables are associated with constraints

** surplus variables are associated with constraints
9 of 22
18. At the reported optimal solution, which of the following is true about the Monday lunch
selection?
A. Calories from fat constitute exactly 30% of total calories.

B. Calories from fat constitute 1.25 calories less than the 30% limit in terms of total
calories.
C. Calories from fat exceed the 30% limit in terms of total calories.
D. None of the above.
Note that constraint 5 is
10B+75P+0S+20G+70M+0J < 0.3(70B+100P+50S+60G+150M+100J)
Or
0.3(70B+100P+50S+60G+150M+100J)> 10B+75P+0S+20G+70M+0J
(That is, 30% of total calories should be at least (greater
or equal to) the amount of calories from fat.)
which was simplified and rewritten as 11B-45P+15S-2G-25M+30J>0

-------------- --------------- ------------------
5 1.250 0.000
The surplus amount is 1.25, indicating that the 30% of Total Calories is greater than
calories from fat by 1.25 calories.
19. At the reported optimal solution, how many milligrams of vitamin C are provided to a
child in a Monday lunch?
A. 60
B. 61
C. 120
D. 121
The vitamin C constraint is 3S+2M+120J>60

-------------- --------------- ------------------
3 61.000 0.000
At optimal solution, the surplus value is 61 (indicating that the amount of vitamin C
used was exceeded by 61). Since the original amount is 60, the amount used = 60 + 61
= 121
10 of 22
20. Which of the following provides a correct conclusion about the Monday lunch based
upon the nonzero slack/surplus variable reported for constraint 6?
A. At the reported optimal solution, the amount of strawberry jelly is 0.85

tablespoon.
B. At the reported optimal solution, the required amount of peanut butter is
exceeded by 0.85 tablespoon.
C. At the reported optimal solution, the amount of peanut butter is 0.85 tablespoon
more than double the amount of strawberry jelly.
D. At the reported optimal solution, the amount of peanut butter is 0.85 tablespoon
less than double the amount of strawberry jelly.
E. None of the above.
Constraint 6 is 1P-2S>0

-------------- --------------- ------------------
6 0.850 0.000
The surplus amount of 0.85 indicates that peanut butter is greater than twice the
amount of strawberry jelly (P > 2S) by 0.85
21. If the cost of milk increases to 37.5 cents per cup, will the reported optimal solution still
be optimal?
A. Yes, it will still be optimal.

B. No, it will no longer be optimal.
C. Not enough information is available on the computer output to answer this
question.

------------ --------------- --------------- ---------------
M 6.000 20.000 37.000
Since the upper limit is 37 (less than 37.5), the optimal solution will no longer optimal.
11 of 22
22. If the cost per tablespoon of strawberry jelly is the same as the current cost per
tablespoon of peanut butter, will the reported optimal solution still be optimal?
A. Yes, it will still be optimal.

B. No, it will no longer be optimal.
C. Not enough information is available on the computer output to answer this
question.

------------ --------------- --------------- ---------------
The current cost of peanut butter is 4 cents/tablespoon. If the cost per tablespoon of
strawberry jelly is decreased to 4 cents (from 7 cents), the optimal solution will remain
optimal (lower limit = 2, more than 4).
23. If the required total amount of liquid (milk and/or orange juice) is increased to 2 cups, will
the current optimal objective function value increase or decrease and by how much?
A. Optimal total cost will decrease by 7 cents.

B. Optimal total cost will increase by 14 cents.
C. Optimal total cost will remain the same.
D. The revised LP problem will need to be solved in order to answer this question.
8) 1M+1J>1.5

-------------- --------------- ------------------
8 0.000 -14.000

------------ --------------- --------------- ---------------
8 1.471 1.500 2.067
Since the RHS upper limit is 2.067 (greater than 2), the dual price of -14 applies.
This means that cost change by (2 1.5)(-14) = -7 (Cost will increase by 7 cents). Note
that negative dual price implies that the OFV will worsen when you increase the RHS of a
binding constraint.
The correct answer is Optimal total cost will increase by 7 cents
12 of 22
24. If the required number of slices of bread were increased to 3 slices, will the current
optimal objective function value increase or decrease and by how much?
A. Optimal total cost will increase by 5.5 cents.

B. Optimal total cost will increase by 2.7 cents.
C. Optimal total cost will decrease by 2.7 cents.
D. The revised LP problem will need to be solved in order to answer this question.
9) 1B=2

-------------- --------------- ------------------
9 0.000 -2.700

------------ --------------- --------------- ---------------
9 1.971 2.000 3.214
Since the RHS upper limit is 3.214 (greater than 3), the dual price of 2.7 applies.
This means that cost change by (3 2)(-2.7) = -2.7 (Cost will increase by 2.7 cents). Note
that negative dual price implies that the OFV will worsen when you increase the RHS of a
binding constraint.
25. Which of the following is an appropriate interpretation of the reduced cost reported for
the variable G?
A. The cost of a graham cracker needs to go down to 8.5 cents/piece in order for a
positive quantity of graham cracker to appear in the optimal solution.
B. The cost of a graham cracker needs to go down to 2.4 cents/piece in order for a
positive quantity of graham cracker to appear in the optimal solution.
C. Neither A nor B
Reduced Cost is the amount by which the cost (of Graham crackers) should be reduced
before Graham crackers could be included in the lunch.

-------------- --------------- ------------------
G 0.000 8.500
The current cost of Graham crackers is 10.9 cents/piece. For Graham crackers to be
included in the lunch, the cost should reduce by 8.5 cents to (10.9 8.5) 2.4 cents.
13 of 22
26. If the minimum amount of orange juice in the Monday lunch were increased to 1.5 cups,
can you tell if the current optimal objective function value will increase or decrease and
by how much?
A. Optimal total cost will decrease by 8.5 cents
B. Optimal total cost will increase by 8.5 cents.
C. Optimal total cost will decrease by 17 cents
D. Optimal total cost will increase by 17 cents.
E. The revised LP problem will need to be solved in order to answer this question.
7) 1J>1

-------------- --------------- ------------------
7 0.000 -17.000

------------ --------------- --------------- ---------------
7 0.962 1.000 1.480
Since the RHS upper limit is 1.48 (less than 1.5), the dual price of 17 cannot apply.
The model needs to be re-solved to obtain the new cost.
27. If the cost of strawberry jelly decreases to 4.5 cents per tablespoon, which of the
following will be true?
A. The amount of strawberry jelly in the optimal solution will continue to be zero.
B. The amount of strawberry jelly in the optimal solution may take on a positive
value.
C. The revised LP problem will need to be solved in order to answer this question.
D. None of the above.
Method 1
------------ --------------- --------------- ---------------
If the cost per tablespoon of strawberry jelly is decreased to 4.5 cents (from 7 cents), the
optimal solution will remain optimal (lower limit = 2, more than 4.5). Thus the optimal
solution does not change. That is, the amount of strawberry jelly in the optimal solution
will continue to be zero.
Method 2
-------------- --------------- ------------------
S 0.000 5.000
Note that the dual price is 5. That is, the cost of strawberry jelly needs to be reduced by at
least 5 before strawberry jelly could be included in the lunch. Decreasing the amount
from 7 to 4.5 is just a 2.5 decrease not enough to warrant the inclusion of jelly in the
lunch.
14 of 22
#28 to 39 are chapter 12 questions. You may

not need them if your final is not cumulative.
28. In a CPM network, activities K, L, and M have been identified as activities whose
duration may be shortened through the use of overtime, additional workers, and/or
additional equipment. Slack times, in weeks, are 1 for K, 2 for L, and 0 for M. It has
been determined that activity K may be shortened by 1 week, while activities L and M
may each be shortened by 2 weeks. Which of these activities would you try to shorten
the duration of, if the objective is to reduce project completion time by at least two
weeks?
A. L only
B. M only
C. Both K and L
D. Both L and M
E. All of K, L, and M
29. Which of the following is NOT always true about the critical activities of a project?
A. They all lie on a single path in the project network.
B. Shortening one or more of them may shorten the project completion time.
C. Not a single one of them should be delayed if the project is to be completed by
the target project completion time.
D. They have no slack. + 4 +
E. All of the above are always true. =
6
10 + 4(18) + 20
Questions #30 - #39 =
6
= 17
Following estimates of activity times (in days) are available for a mid size project.
Activity Predecessor Optimistic Most Likely Pessimistic Expected

Activities (a) (m) (b) Time
A - 1 2 3 2.00
B - 2 3 4 3.00
C - 4 7 10 7.00
D - 10 18 20 17
E A 4 8 12 8.00
F C 2 6 10 6
G B, E 6 9 12 9.00
H B, F 8 13 6 11
I F 6 8 10 8.00
J G, H 3 5 13 6.00
K G, H, I 7 14 21 14
Compute the missing expected activity completion times and answer the following ten
questions. (Background work will be needed to answer questions, but will not be marked.)
30. What is the earliest start time for activity K?

A. 19 See project network
B. 20 on next page
C. 24
D. 30
15 of 22
31. What is the earliest finish time for activity H?

A. 22
B. 28
EF for activity H is 24
C. 13
D. 30
32. What is the latest start time for activity D?
A. 0
B. 17
LS for activity D is 21
C. 19
D. 23
33. What is the latest finish time for activity H?
A. 30
B. 10
LF for activity H is 24
C. 13
D. 21
34. What are the critical activities?
A. AEGJ
B. CFIK
C. BHK
D. CFHK
16 of 22
35. What is the project completion time (days)?
A. 22
B. 28
C. 36 Completion time is 38 days
D. 19
36. Which activity among activities B, C, G, I, and K has the most slack time?
A. Activity C
B. Activity B
C. Activity G
D. Activity I
E. Activity K
37. What is the probability that the project will be completed within 40 days? (Choose the
closest value)
A. 41.62%
B. 91.62%
C. 43.19%
??
D. 50%
E. 75.49%
Project Variance,
2 = 2 + 2 + 2 + 2
= 1 + 1.7778 + 0.1111 + 5.4444
= 8.333
= 2 = 8.333 = 2.8867
40 38
= = = 0.69
2.8867
( < 0.69) = 0.7549
17 of 22
38. If you want a 0.91 probability of completing the project on time, how far ahead should you
begin working on the project?
A. Approximately 9 days earlier

B. Approximately 6 days earlier
C. Approximately 4 days earlier
D. Approximately 1 day earlier
E. Approximately 7 days earlier
By reverse lookup for 0.91 in the z table, the

corresponding z score is 1.34. = 38, = 2.8867
38
= 1.34 =
2.8867
= 1.34(2.8867) + 38 = 41.87 42
(about 4 days earlier)
39. Which of the following statement is true if current times related to activity D, which are a=10,
m=18 and b=20, were revised to a=18, m=38, b=58?
[i] Critical path will be AEGJ

[ii] Probability that project will be completed in more than 40 days is 34.51%.
[iii] Project completion time will be same as it was before revision.
[iv] Critical Path will have only activity D.
[v] Probability that project will be completed within 40 days is 11.79%.
A. [i] and [iv] are true.

B. [i] and [v] are true.
C. [ii], [iii], [v] are true.
D. [ii], [iii] and [iv] are true.
E. [ii] and [iv] are true.
18 + 4(38) + 58
= = 38
6
This will imply we have another critical path comprising of

activity D only.
18 of 22
40. A simulation model uses the mathematical expressions and logical relationships of the
A. real system.
B. computer model.
C. performance measures. Chapter 15
D. estimated inferences.
41. Let A, B, and C be the amounts invested in companies A, B, and C. If no more than 50% of
the total investment can be in company B, then
A. B<5
B. A - .5B + C < 0
C. .5A - B - .5C < 0
D. -.5A + .5B - .5C < 0
Chapter 9
0.5( + + )
0.5 + 0.5 + 0.5
0.5 0.5 0.5 0
0.5 + 0.5 0.5 0
42. The graph of a problem that requires x1 and x2 to be integer has a feasible region
A. the same as its LP relaxation.
B. of dots.
C. of horizontal stripes.
D. of vertical stripes.
Questions #44 - #45

The North York Company has a contract to produce 10000 bicycles for a customer. The
company has 4 different machines that can produce this kind of bicycles. Because these
machines are from different manufacturers and use differing technologies, their specifications
are not the same.
Fixed Cost to Variable

Machine Set Up Cost Capacity
Production Run Per Bicycle
1 750 1.25 6000
2 500 1.50 7500
3 1000 1.00 4000
4 300 2.00 5000
The decision variables are defined as follows:
xi = the number of bicycles produced on machine i
yi = 1 if machine i is used, = 0 otherwise
19 of 22
43. The company wants to minimize total cost. Select the appropriate objective function.
A. Min 750y1 + 500y2 + 1000y3 + 300y4 + 1.25x1 + 1.5x2 + x3 + 2x4

B. Min 750x1 + 500x2 + 1000x3 + 300x4 + 1.25y1 + 1.5y2 + y3 + 2y4
C. Min 6000y1 + 7500y2 + 4000y3 + 5000y4 + 1.25x1 + 1.5x2 + x3 + 2x4
D. None of the above
44. Select an appropriate constraint to ensure that if machine 4 is used, machine 1 will not be
used.
A. y1 + y4 0 Chapter 11 (0-1 variables)

B. y1 + y4 = 0 Mutually Exclusive constraints
C. y1 + y4 1
D. y1 + y4 0
E. y1 + y4 1
45. Select an appropriate constraint to ensure that machine 1 cannot be used unless machine 2
is used.
A. y1 y2 0 Chapter 11 (0-1 variables)

B. y1 + y2 = 0 Conditional constraints
C. y1 + y2 1
D. y1 + y2 0
E. y1 + y2 1
46. Suppose a product can be manufactured either not at all or else in production lot sizes L,
and let x be the quantity of the product produced. The production capacity of this product is 20
and y is a 0-1 variable. The following two constraints are appropriate:
A. x 20 y 0; x Ly 0 Chapter 11 (0-1 variables)

B. x 20 y 0; x Ly 0
C. x 20 y 0; x Ly 0
D. x 20 y 0; x Ly 0
47. Consider the following linear programming problem:
Maximize 20X + 30Y

Subject to X + Y 80
8X + 9Y 600
3X + 2Y 400
X, Y 0
This is a special case of a linear programming problem in which

A. there is no feasible solution.
B. there is a redundant constraint.
C. there are alternative optimal solutions.
D. this cannot be solved graphically.
20 of 22
48. When formulating transportation LP problems, constraints usually deal with the
A. number of items to be transported.
B. shipping cost associated with transporting goods.
Chapter 10
C. distance goods are to be transported.
D. number of origins and destinations.
E. capacities of origins and requirements of destinations.
21 of 22
49. When formulating transportation LP problems, the objective function usually deals with the
A. number of items to be transported.
B. choice of transportation mode (e.g., truck, airplane, railroad, etc.).
C. shipping cost or distances associated with transporting goods.
D. number of origins and destinations.
Chapter 10
E. capacities of origins and requirements of destinations.
50. Which of the following statement is false?

A. An integer programming solution can never produce a greater profit objective than
the LP relaxation solution to the same problem.
B. The solution to the LP Relaxation of a minimization problem will always be less
than or equal to the value of the integer program minimization problem.
C. In a model involving fixed costs, the 0 - 1 variable guarantees that the capacity is
not available unless the cost has been incurred.
D. integer programming might be applicable to selecting the best gymnastics team
to represent a country from among all identified teams.
Chapter 11
22 of 22

3330 Final Fall 2010 MCQ + Solutions

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

3330 Final Fall 2010 MCQ + Solutions

Încărcat de

Drepturi de autor:

Formate disponibile

AP/ADMS 3330.3.

0 Fall 2010 Final Exam Part 1

PART I (1 mark each; total = 50 marks)

1. An integer programming (minimization) problem was first solved as a LP relaxation problem,

*OFV = Objective Function Value

2. A negative dual price for a constraint in a minimization problem means

Note that option D is also correct.

Chapter 7 (7.6 special cases)

5. Which of the following statement is false?

Chapter 8 (Simultaneous changes)

Time Between Arrivals Probability

Service Time (minutes) Probability

7. Consider the following linear programming problem:

Maximize 12X + 10Y

The maximum possible value for the objective function is

8. In a 0-1 integer programming model, if the constraint x1-x2 = 0 is specified, it means

Chapter 11 (11.4 0-1 integer variables)

9. The solution to the linear programming relaxation of an integer programming

A. greater than or equal to

*OFV = Objective Function Value

11. A rounded solution to a maximization ILP may not be feasible because

A. it violates at least one of the technical constraints

Questions #15 - #27

Calories Total Vitamin C Protein Cost

Constraint Slack/Surplus Dual Prices

OBJECTIVE COEFFICIENT RANGES

RIGHT HAND SIDE RANGES

Binding constraints have 0

Constraints 1 & 2 are the total number of calories constraints

Constraint Slack/Surplus Dual Prices

Method 2: Using Constraint 2

Constraint Slack/Surplus Dual Prices

* slack variables are associated with constraints

A. Calories from fat constitute exactly 30% of total calories.

Note that constraint 5 is

10B+75P+0S+20G+70M+0J < 0.3(70B+100P+50S+60G+150M+100J)

which was simplified and rewritten as 11B-45P+15S-2G-25M+30J>0

Constraint Slack/Surplus Dual Prices

The vitamin C constraint is 3S+2M+120J>60

Constraint Slack/Surplus Dual Prices

A. At the reported optimal solution, the amount of strawberry jelly is 0.85

Constraint Slack/Surplus Dual Prices

A. Yes, it will still be optimal.

OBJECTIVE COEFFICIENT RANGES

A. Yes, it will still be optimal.

OBJECTIVE COEFFICIENT RANGES

A. Optimal total cost will decrease by 7 cents.

Constraint Slack/Surplus Dual Prices

RIGHT HAND SIDE RANGES

The correct answer is Optimal total cost will increase by 7 cents

A. Optimal total cost will increase by 5.5 cents.

Constraint Slack/Surplus Dual Prices

RIGHT HAND SIDE RANGES

Variable Value Reduced Costs

Constraint Slack/Surplus Dual Prices

RIGHT HAND SIDE RANGES

#28 to 39 are chapter 12 questions. You may

Activity Predecessor Optimistic Most Likely Pessimistic Expected

30. What is the earliest start time for activity K?

31. What is the earliest finish time for activity H?

32. What is the latest start time for activity D?

33. What is the latest finish time for activity H?