X 213231124
X 213231124
X 213231124
ISDS702STACKED-STACKED-25412-SPRING2016
April 2, 2016
Started
Finished
State
Completed
on Time
3 hours
taken
41.00/50.00
Marks
Grade
Question
1
Correct
Mark 1.00 out
of
1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three ges of the
u
manufacturing process: assembly, finishing, and inspection. Each table
1 ho
2 rs
3 f 4 se
5 bly
6 27 our
o as m ,
h
requi
res
3
Current
y, finishing,
ch
we
k
of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly,
2
hours of
and
1
12
l
e
e th
80.
hour of inspection. The profit per table is $120 while the profit per chair is
8 9 10
13 14 ere
$
11a
are 200 hours of assembly time available, 180 hours of finishing time, and 40
hou rs f inspection time.
15 16 17 18 19 20 21
Linear programming is to be used to develop a production schedule. Definehe
t vao les as
ows: X =
ria
22
foll 26 27 28
number of tables produced each week, and Y = number of chairs of produced
each23
w 24
ek. 25
Suppose it is decided that the number of hours used in the assembly process u
m e
of
bt at
29 30
31 eas
32 90
33 per
34 en
35
s ebel written?
t
c
t
the number of hours used in the finishing department. How would this constraint
36 37 38 39 40 41 42
Select one:
a. 1.8X + 1.8Y 0.10
b. 1.8X + 1.2Y
0.90
c. 1.2X - 0.2Y
0.90
43 44 45 46 47 48 49
50
Show one page at a
time Finish review
d. 3X + 2Y
0.90
e. 1.2X + 0.2Y 0
Question
Correct
Mark 1.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages
of th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2
hours of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is
$80. Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time,
and 40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X
= number of tables produced each week, and Y = number of chairs of produced each week. Suppose it
is also decided that the number of hours used in the assembly process must be at least 90 percent
of the numbe of hours used in inspection department, How would this constraint be written?
Select one:
c. X + Y 0.9
d. 2.1 X + 1.1 Y 0
e. 1.1 X + 2.1 Y 0
The correct answer is: 2.1 X + 1.1 Y 0
1 of 22
Correct
Mark 1.00 out
of 1.00
Refer to the portfolio selection problem on pages 303 - 305 in textbook. How many decision variables
are there? How many constraints are there?
Select one:
Incorrect
constraints.
The correct answer is: There are 4 decision variables and 7 constraints.
X, Y 0
Solve the LP problem using the graphical method. Which one of the following statements about the
value of dual price for the 2nd constraint is correct?
Correct
Mark 1.00 out
of 1.00
zero.
The correct answer is: The dual price for the 2nd constraint must be zero.
Refer to Problem 7.38 (on page 285 in textbook) and Computer Output 7.38 (on page 286 in textbook).
Would the optimal solution change if return for each dollar in the money market fund were 0.01 instead of
0.05?
Select one:
a. Both S* and M* change.
b. S* remains the same, but M*
changes.
the same.
the same.
The correct answer is: Both S* and M* remain the same.
2 of 22
Correct
Mark 1.00 out
of 1.00
Refer to Problem 7.38 (on page 285 in textbook) and Computer Output 7.38 (on page 286 in textbook).
Would the optimal solution change if return for each dollar in the money market fund were 0.08 instead
of 0.05?
Select one:
Correct
Mark 1.00 out
of 1.00
$3X +
$9Y s.t. X + Y 10
....(1) Y 6 .............
(2)
both X and Y 0
There are two lines. Which constraint line(s) is(are) nonbinding?
Select one:
a. Both line #1 and line #2 are
nonbinding.
is nonbinding.
Question
Correct
Mark 1.00 out
of 1.00
c. Only line #1 is
nonbinding.
c. (500, -50)
d. (0, 200)
e. (500, 50)
The correct answer is: (500, 50)
Question
Correct
Mark 1.00 out
of 1.00
Cheryl wishes to invest her inheritance of $200,000 so that her return on investment is maximized, but
she also wishes to keep her risk level relatively low. She has decided to invest her money in any of
three possible ways: CDs, which pay a guaranteed 6 percent; stocks, which have an expected return of
13 percent; and a money market mutual fund, which is expected to return 8 percent. She has decided
c. - 3 C - 3 S + M 0
d. C - S - 3 M 0
e. - 3 C + S - 3 M 0
The correct answer is: - C - S +3 M 0
Question
10
Incorrect
Mark 0.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages
of th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours
of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X =
number of tables produced each week, and Y = number of chairs of produced each week. Suppose
it is also decided that there must be 4 chairs produced for every table. How would this constraint be
written?
Select one:
a. - X + Y 4
b. X + Y = 4
c. X - 4 Y = 0
d. 4 X - Y = 0
e. X - Y 4
The correct answer is: 4 X - Y = 0
Question
11
Correct
Mark 1.00 out
of 1.00
7X+8Y
............ (2)
X 0 and Y 0
Using graphical method which constraint(s) is (are) non-binding?
constraint.
d. Neither constraint #1 nor constraint #2 is non-binding constraint.
Question
12
Incorrect
Mark 0.00 out
of 1.00
$4X +
$6Y s.t. X + Y
10 ....(1)
X 4 .............(2)
both X and Y 0
What can you say about the dual price for the 2nd constraint?
Question
13
Correct
Mark 1.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages
of th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours
of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X
= number of tables produced each week, and Y = number of chairs of produced each week. What would
the
objective function be?
Select one:
a. MAXIMIZE
Y
200 X + 200
b. MAXIMIZE 80 X + 120 Y
c. MAXIMIZE 120 X + 80 Y
d. MAXIMIZE
e. MAXIMIZE
Question
14
X +Y
6X+5Y
Correct
Mark 1.00 out
of 1.00
The linear programming model of the production mix problem only includes constraints of the less than
or equal form.
Select
one:
True
Question
15
Correct
Mark 1.00 out
of 1.00
False
Refer to Problem 7.38 (on page 285 in textbook) and Computer Output 7.38 (on page 286 in textbook).
binding.
The correct answer is: Constraint #2 is non-binding, but constraint #3 is binding.
Question
16
Correct
Mark 1.00 out
of 1.00
Cheryl wishes to invest her inheritance of $200,000 so that her return on investment is maximized, but
she also wishes to keep her risk level relatively low. She has decided to invest her money in any of
three possible ways: CDs, which pay a guaranteed 6 percent; stocks, which have an expected return of
13 percent; and a money market mutual fund, which is expected to return 8 percent. She has decided
a. C + S + M 200,000
b. C + S + M 200,000
c. C + S + M = 200,000
d. 0.06 C + 0.13 S + 0.08 M 200,000
e. 0.06 C + 0.13 S + 0.08 M 200,000
Question
17
Correct
Mark 1.00 out
of 1.00
e. point (4, 6)
The correct answer is: point (0, 10)
18
Correct
Mark 1.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages
of th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours
of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X
= number of tables produced each week, and Y = number of chairs of produced each week. Suppose it
is also
decided that the number of hours used in the assembly process must be at least 80 percent of the
numbe of hours used in finishing department, How would this constraint be written?
Select one:
a. 0.4 X + 1.4 Y 0
b. 1.4 X + 0.4 Y 0.8
c. 1.4 X + 0.4 Y 0
d. 1.4 X - 0.4 Y 0.8
e. X + Y 0.8
Question
19
Correct
Mark 1.00 out
of 1.00
Diamond Jeweler's is trying to determine how to advertise in order to maximize their exposure. Their
weekly advertising budget is $10,000. They are considering three possible media: TV, newspaper, and
radio.
Medium
audienc
maximum
e
ads per
reached cost per
week
ad ($)
per ad
TV
7,000
800
10
Newspape
r Radio
8,500
1000
3,000
400
20
Let T = the # of TV ads, N = the # of newspaper ads, and R = the # of radio ads.
Which of the following set of inequalities properly represent the limits on advertisements per week by
media? Select one:
a. T 10; N 7; R
20
37
b. 10T + 7N + 20R
c. T + N + R 37
d. T + N + R 37
e. T 10; N 7; R 20
The correct answer is: T 10; N 7; R 20
Question
20
Correct
Mark 1.00 out
of 1.00
Given the following linear programming (LP) problem with three constraints:
MAXIMIZE 60 X + 90 Y
s.t.
X3
............ (1)
Y 5 ............ (2)
X - 3Y 6 ....... (3)
X 0 and Y 0
Using graphical method which constraint(s) is (are) binding?
21
Correct
Mark 1.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages of
th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours
of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X =
number of tables produced each week, and Y = number of chairs of produced each week. Suppose it is
also decided that the number of hours used in the assembly process must be at most 80 percent of
the number of hours used in inspection department, How would this constraint be written?
Select one:
a. 2.2 X + 1.2 Y 0
b. 1.2 X + 2.2 Y 0
c. 2.2 X - 1.2 Y 0.8
d. X + Y 0.8
e. 2.2 X + 1.2 Y 0.8
The correct answer is: 2.2 X + 1.2 Y 0
Question
22
Correct
Mark 1.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages
of th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours
of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X
= number of tables produced each week, and Y = number of chairs of produced each week. Which of
the
following would be a necessary constraint in the LP problem?
Select one:
a. 2 X + 2 Y 40
b. 2 X + 3Y
200
c. 120 X + 80 Y 1000
d. X + Y 40
e. 3 X + 2 Y 200
Question
23
Correct
Mark 1.00 out
of 1.00
The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint in
an LP model is referred to as:
Select one:
a.
constraint
b.
dual price
c. slope
Question
24
Correct
Mark 1.00 out
of 1.00
d. surplus
e. slack
In linear programming applications, when formulating Production Scheduling problem, the objective
function usually deals with:
Select one:
a. minimization of the total number of items to be
transported.
b. total cost.
modes.
e. total capacity and total demand.
The correct answer is: total cost.
Question
25
Correct
Mark 1.00 out
of 1.00
Graphically solve the following linear programming (LP) problem with 2 constraints:
MAXIMIZE
$4X +
$6Y s.t. X + Y 10
....(1)
X 4 .............(2)
both X and Y 0
Change the right-hand side of constraint #1 from 10 to 11 and resolve the LP problem. How much will
the optimal value of objective function change as a result of this?
Select one:
a. remain the
same.
b. increase
by $6
c.
increase by $10
Question
26
Correct
Mark 1.00 out
of 1.00
d.
decrease by $6
e. increase by $4
The correct answer is: increase by $6
Media selection problems are typically approached with linear programming (LP) by
either: Select one:
a.
maximizing the number of different media or minimizing advertising costs.
b. minimizing the number of different media or minimizing advertising
Question
27
costs.
c.
maximizing audience exposure or minimizing advertising costs.
Correct
a. resource constraint
b. nonbinding constraint
c. infeasible constraint
d. binding constraint
e. feasible
constraint
The correct answer is: binding constraint
Question
28
Correct
Mark 1.00 out
of 1.00
Refer to the Media Selection problem on pages 292 and 293 in textbook. How many decision variables
are there? How many constraints are there?
Select one:
a. There
constraints.
7 constraints.
are
28
decision
variables
and
4 constraints.
d. There are 4 decision variables and 7 constraints.
e. There are 4 decision variables and 11
Question
29
Correct
Mark 1.00 out
of 1.00
constraints.
The correct answer is: There are 4 decision variables and 7 constraints.
MAXIMIZE 4X + 15Y
s.t. -2X + 3Y 6 ..... (1)
3X + 5Y 10 .... (2) X, Y 0
There are two lines. Which line(s) is(are) binding?
Select one:
a. Only line #1 is binding.
b. Both line #1 and line #2 are binding.
Question
30
Correct
Mark 1.00 out
of 1.00
Given the following linear programming (LP) problem with three constraints:
MAXIMIZE 90 X + 10 Y
s.t.
X8
............ (1)
2X - Y 1 ............ (2)
Y 3
............. (3)
X 0 and Y 0
Using the graphical method what is the optimal value of slack variable for the second constraint?
c.
S2 * = 1
d. S2* = 0
e. S2* = 4
Question
31
Correct
Mark 1.00 out
of 1.00
4X - 2Y 14 .... (3)
X - 3Y 1 .....(4)
4X - 2Y 0 ......(5) both X and Y 0
There are 5 constraint lines and 6 corner points. The corner point (1.43, 2.86) is the intersection of?
Select one:
a. line #1 and line #3.
b. line #2 and line #5.
c. line #3 and line #4.
d. line #4 and line #5.
e. line #1 and line #2.
Question
32
Correct
Mark 1.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages
of th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours
of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X
= number of tables produced each week, and Y = number of chairs of produced each week.
Suppose it is decided that the number of hours used in the assembly process must be at least 70
percent of the number of hours used in the finishing department. How would this constraint be
written?
Select one:
a. 1.6X + 0.6Y 0
b. 1.6X + 2Y 0.30
33
Correct
Mark 1.00 out
of 1.00
Y 6 ........ (2) X, Y 0
Solve the LP problem using graphical method with 2 decimal places. What is the optimal solution?
b. X* = 4.00 and Y*
= 0.00
Y* = 6.00
c. X* = 1.50 and
d. X* =0.00 and
Y* = 6.00
34
Incorrect
Mark 0.00 out
of 1.00
Select one:
a. Dual price for the 2nd constraint cannot be
zero.
zero.
Question
35
Correct
The correct answer is: Dual price for the 2nd constraint cannot be zero.
For linear programming applications, what are the decision variables in the diet
problems? Select one:
a. amount of each ingredient to use
b. minimization of total cost
36
Correct
Mark 1.00 out
of 1.00
............ (2)
Y 13 ............ (3)
X 0 and Y 0
Using the graphical method what can you say about the dual price of the second constraint?
Question
37
Incorrect
Mark 0.00 out
of 1.00
X, Y 0
Solve the LP problem using the graphical method. What is the value of slack variable for the 2nd
constraint if the optimal solution is employed?
a. 3.00
b. 4.00
c. 1.00
d. 0.00
e. 2.00
Question
38
Correct
A small furniture manufacturer produces tables and chairs. Each product must go through three stages of
th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of assembly,
2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours of
finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X
= number of tables produced each week, and Y = number of chairs of produced each week. Which of
the following would be a necessary constraint for inspection in the LP problem?
Select one:
a. X + Y 200
b. 3 X + 2 Y 40
c. X + Y 180
d. 120 X + 80Y 1000
e. X + Y 40
The correct answer is: X + Y 40
39
Incorrect
Mark 0.00 out
of 1.00
Graphically solve the following linear programming (LP) problem with 2 constraints:
MAXIMIZE
$4X +
$6Y s.t. X + Y 10
....(1) X 4 .............
(2)
both X and Y 0
What is the optimal value of slack variable S1?
a. 0
b. 2
c. 10
d. 6
Question
40
Correct
Mark 1.00 out
of 1.00
e. 4
Refer to Problem 7.38 (on page 285 in textbook) and Computer Output 7.38 (on page 286 in textbook).
How much would be total return change if the minimal amount that must be invested in the money
market fund were changed from $40,000 to $45,000?
Select one:
a.
500.
increase
by
b. decrease
by 500.
c. increase
by 250.
d. decrease by 250.
e. remain the
same.
The correct answer is: decrease by 250.
Question
41
Incorrect
Mark 0.00 out
of 1.00
The 4 corner points in feasible region are (48,84), (0,120), (0,0), (90,0). How many non-binding
constraint(s) i (are) there?
Select one:
a. 4 non-binding
constraints
b. 3 non-
binding constraints
c. 0
non-binding constraint
d. 1
non-binding-constraint
e. 2 non-binding constraints
Question
42
Correct
Mark 1.00 out
of 1.00
Consider the following linear programming (LP) problem with two constraints:
MINIMIZE 7X + 8Y
s.t. -4X + 3Y 12 ..... (1)
Y 6 ........ (2) X, Y 0
Solve the LP problem using the graphical method. How many nonbinding constraint line(s) is (are) there?
Select one:
a. There is only one nonbinding constraint line.
b. There are three nonbinding constraint
lines.
line.
The correct answer is: There is only one nonbinding constraint line.
Question
43
Correct
Mark 1.00 out
of 1.00
4X - 2Y 14 .... (3)
X - 3Y 1 .....(4)
4X - 2Y 0 ......(5) both X and Y 0
There are 5 constraint lines and 6 corner points. The corner point (4.33, 3.58) is the intersection of?
Select one:
a. line #3 and line #4.
b. line #1 and line #3.
44
Correct
Mark 1.00 out
of 1.00
When two or more constraints in linear programming conflict with one another, we have a condition
called unboundedness.
Select
one:
True
Question
45
Incorrect
Mark 0.00 out
of 1.00
False
Refer to Problem 7.38 (on page 285 in textbook) and Computer Output 7.38 (on page 286 in textbook).
Would the optimal solution change if return for each dollar in the stock fund were 0.04 instead of 0.10?
Select one:
a. Both S* and M* change.
Question
46
Correct
Mark 1.00 out
of 1.00
s.t.
X8
............ (1)
2X - Y 1 ............ (2)
Y 3
............. (3)
X 0 and Y 0
Using the graphical method what is the optimal value of slack variable for the first constraint?
a. S1* = 6
b. S1* = 5
c. S1* =
4 d. S1*
e.
S1* = 0
Question
47
Correct
Mark 1.00 out
of 1.00
A small furniture manufacturer produces tables and chairs. Each product must go through three stages
of th manufacturing process: assembly, finishing, and inspection. Each table requires 3 hours of
assembly, 2 hour of finishing, and 1 hour of inspection. Each chair requires 2 hours of assembly, 2 hours
of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80.
Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and
40 hours of inspection time.
Linear programming is to be used to develop a production schedule. Define the variables as follows: X
= number of tables produced each week, and Y = number of chairs of produced each week. Suppose it
is also decided that the number of hours used in the finishing process must be at most 80 percent of
the numbe of hours used in inspection department,
Select one:
a. 1.2 X - 2.2 Y 0.8
b. X + 1.2 Y 0.8
c. 2.2 X + 0.8 Y 0.8
d. 2.2 X + 1.2 Y 0.8
e. 1.2 X + 1.2 Y 0
The correct answer is: 1.2 X + 1.2 Y 0
48
Graphically solve the following linear programming (LP) problem with two constraints:
Incorrect
Mark 0.00 out
of 1.00
MAXIMIZE $4X +
$6Y s.t. X + Y 10
....(1) X 4 .............
(2)
both X and Y 0
Which one of the following statements is true?
49
Correct
Mark 1.00 out
of 1.00
$3X +
$9Y s.t. X + Y
10 ....(1)
Y 6 .............(2)
both X and Y 0
What can you say about the dual price for the 1st constraint?
Select one:
a. The dual price for the 1st constraint cannot be zero.
Question
50
Correct
Mark 1.00 out
of 1.00
Diamond Jeweler's is trying to determine how to advertise in order to maximize their exposure. Their
weekly advertising budget is $10,000. They are considering three possible media: TV, newspaper, and
radio.
maximum
reached
Medium
cost per
per ad
ad ($)
ads per
week
TV
7,000
800
10
Newspape
8,500
1000
3,000
400
20
Radio
Let T = the # of TV ads, N = the # of newspaper ads, and R = the # of radio ads. What would the
objective function be?
Select one:
a. Minimize 7000T + 8500N + 3000R