Home

ISDS702STACKED-STACKED-25412-SPRING2016

April 2, 2016

ISDS 702 Test #2

Started
Finished

State

Completed
on Time

3 hours

taken

41.00/50.00

Marks

82.00 out of 100.00

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

The correct answer is: 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:

a. 2.1 X + 1.1 Y 0.9

b. 2.1 X - 1.1 Y 0.9

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

ISDS 702 Test #2

Question

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:

a. There are 7 decision variables and 11

b. There are 7 decision variables and
constraints.
4 constraints.
c. There are 4 decision variables
and 11 constraints.
d. There are 4 decision variables and 7 constraints.
e. There are 11 decision variables and 11
Question

Incorrect

constraints.

The correct answer is: There are 4 decision variables and 7 constraints.

Mark 0.00 out

of 1.00

Consider the following linear programming (LP) problem:

MINIMIZE 7X + 8Y
s.t. -4X + 3Y 12 ..... (1)
Y 6 ........ (2)

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?

Keep your own graph.

Select one:
Question

a. The dual price for the 2nd constraint cannot be zero.

Correct
Mark 1.00 out
of 1.00

b. The dual price for the 2nd constraint must be

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.

c. S* changes but M* remains

the same.

d. Both S* and M* remain

the same.
The correct answer is: Both S* and M* remain the same.

2 of 22

ISDS 702 Test #2

Question

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:

a. Both S* and M* remain the same.

b. Both S* and M* change.
c. S* remains the same, but M* changes.
d. S* changes but M* remains the same.
The correct answer is: Both S* and M* remain the same.
Question

Correct
Mark 1.00 out
of 1.00

Graphically solve the following linear programming (LP) problem:

MAXIMIZE

$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?

Keep your own graph.

Select one:
a. Both line #1 and line #2 are
nonbinding.

b. Neither line #1 nor line #2

is nonbinding.
Question

Correct
Mark 1.00 out
of 1.00

c. Only line #1 is

nonbinding.

d. Only line #2 is nonbinding.

The correct answer is: Only line #2 is nonbinding.

Determine where the following two constraint lines

intersect. 2X - 4Y = 800
X + 6Y = -200
Select one:
a. (50, 500)
b. (400, 0)

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

that any or all of the

$200,000 may be invested, but any part (or all) of it may be put in any of the 3 alternatives. Thus, she
may have some money invested in all three alternatives. In formulating this as a linear programming
problem, define the variables as follows: C = dollars invested in CDs, S = dollars invested in stocks, M
= dollars invested in money market mutual fund. Suppose that Cheryl also decided that the amount
invested in money market must not exceed one-fourth of the total amount invested. Which is the
best way to write this constraint?
Select one:
a. 3 C + S - M 0
b. - C - S +3 M 0

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

Given the following linear programming (LP) problem with 2 constraints:

MINIMIZE

7X+8Y

s.t. 2X - 3 Y 6 ............ (1)

X 6

............ (2)

X 0 and Y 0
Using graphical method which constraint(s) is (are) non-binding?

Keep your own graph.

Select one:
a. Constraint #2 is the only one non-binding constraint.
b. Both constraint #1 and constraint #2 are non-binding
constraints.

c. Constraint #1 is the only one non-binding

constraint.
d. Neither constraint #1 nor constraint #2 is non-binding constraint.
Question

12

Incorrect
Mark 0.00 out
of 1.00

The correct answer is: Constraint #2 is the only one non-binding

constraint.
Graphically solve the following linear programming (LP) problem with two constraints:
MAXIMIZE

$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?

Keep your own graph.

Select one:
a. The dual price for the 2nd constraint cannot be zero.

b. The dual price for the 2nd constraint must be

zero.
The correct answer is: The dual price for the 2nd constraint must be zero.

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

The correct answer is: MAXIMIZE 120 X + 80 Y

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

The correct answer is 'False'.

Refer to Problem 7.38 (on page 285 in textbook) and Computer Output 7.38 (on page 286 in textbook).

Which one of the following is correct?

Select one:
a. Constraint #2 is non-binding, but constraint #3 is binding.

b. Both constraint #2 and constraint #3 are non-binding.

c. Constraint #2 is binding, but constraint #3 is nonbinding.

d. Both constraint #2 and constraint #3 are

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

that any or all of the

$200,000 may be invested, but any part (or all) of it may be put in any of the 3 alternatives. Thus, she
may have some money invested in all three alternatives. In formulating this as a linear programming
problem, define the variables as follows: C = dollars invested in CDs, S = dollars invested in stocks, M
= dollars invested in money market mutual fund. Which of the following would be the most appropriate
constraint in the linear programming problem?
Select one:

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

The correct answer is: C + S + M 200,000

Correct
Mark 1.00 out
of 1.00

Graphically solve the following linear programming (LP) problem:

MAXIMIZE $3X +
$9Y s.t. X + Y 10
....(1) Y 6 .............
(2)
both X and Y 0
Which one of the following points is the optimal point?

Keep your own graph.

Select one:
a. point (10, 10)
b. point (0, 6)

c. point (0, 10)

d. point (10, 0)

e. point (4, 6)
The correct answer is: point (0, 10)

ISDS 702 Test #2

Question

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

The correct answer is: 1.4 X + 0.4 Y 0

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.

Information regarding cost and exposure is given in the table below:

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?

Keep your own graph.

Select one:

a. Line #3 is the only binding constraint.

b. Both line #1 and line #2 are binding constraints.
c. Both line #2 and line #3 are binding constraints.
d. Line #1 is the only binding constraint.
Question

21

Correct
Mark 1.00 out
of 1.00

e. Line #2 is the only binding constraint.

The correct answer is: Both line #2 and line #3 are binding constraints.

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 correct answer is: 3 X + 2 Y 200

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

The correct answer is: 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.

c. number of origins and number of

destinations.

d. choice of the transportation

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?

Keep your own graph.

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

d. minimizing audience exposure or minimizing advertising costs.

Mark 1.00 out

of 1.00

e. maximizing audience exposure or maximizing number of ads per time period.

The correct answer is:

maximizing audience exposure or minimizing advertising costs.

In LP model a constraint with zero slack or surplus is called

a: Select one:

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

b. There are 11 decision variables and

c. There are 7 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.

Consider the following linear programming problem:

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?

Keep your own graph.

Select one:
a. Only line #1 is binding.
b. Both line #1 and line #2 are binding.

c. Only line #2 is binding.

d. Neither line #1 nor line #2 is binding.
The correct answer is: 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?

Keep your own graph.

Select one:
a. S2* =
5 b. S2*

c.

S2 * = 1

d. S2* = 0
e. S2* = 4
Question

31

Correct
Mark 1.00 out
of 1.00

The correct answer is: S2* = 0

Refer to your own graph on HW #4 in Module 3.

MAXIMIZE 49 X + 53Y
s.t. 2X + 4Y 23 .... (1)
-X + 4Y 10 ......(2)

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.

The correct answer is: line #2 and line #5.

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

c. 1.6X + 1.6Y 0.70

d. 0.4X + 1.6Y 0.70
e. 1.6X - 0.6Y 0.70
Question

33

The correct answer is: 1.6X + 0.6Y 0

Correct
Mark 1.00 out
of 1.00

Consider the following linear programming (LP) problem:

MINIMIZE 7X + 8Y
s.t. -4X + 3Y 12 ..... (1)

Y 6 ........ (2) X, Y 0
Solve the LP problem using graphical method with 2 decimal places. What is the optimal solution?

Keep your own graph.

Select one:
a. X* = 2.00 and Y* =
0.00

b. X* = 4.00 and Y*

= 0.00
Y* = 6.00

c. X* = 1.50 and
d. X* =0.00 and

Y* = 6.00

e. X* = 0.00 and Y* = 4.00

The correct answer is: X* = 0.00 and Y* = 4.00

ISDS 702 Test #2

Question

34

Incorrect
Mark 0.00 out
of 1.00

Consider the following linear programming (LP) problem:

MAXIMIZE 4X + 15Y

s.t. -2X + 3Y 6 ..... (1)

3X + 5Y 10 .... (2) X, Y 0
Which one of the following statements regarding dual price for the 2nd constraint is true?

Keep your own graph.

Select one:
a. Dual price for the 2nd constraint cannot be

zero.

b. Dual price for the 2nd constraint must be

zero.
Question

35

Correct

The correct answer is: Dual price for the 2nd constraint cannot be zero.

Mark 1.00 out

of 1.00

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

c. types of ingredients to use

Question

36

Correct
Mark 1.00 out
of 1.00

d. cost of items to purchase

e. demand and supply qualities
The correct answer is: amount of each ingredient to use

Given the following linear programming (LP) problem:

MAXIMIZE 120 X + 10 Y
s.t. 3X - Y 1 ............ (1)
X 4

............ (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?

Keep your own graph.

Select one:
a. The dual price of the second constraint should not be zero.

b. The dual price of the second constraint should be zero.

The correct answer is: The dual price of the second constraint should not be zero.

Question

37

Incorrect
Mark 0.00 out
of 1.00

Consider the following linear programming (LP) problem:

MINIMIZE 7X + 8Y

s.t. -4X + 3Y 12 ..... (1)

Y 6 ........ (2)

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?

Keep your own graph.

Select one:

a. 3.00
b. 4.00
c. 1.00
d. 0.00
e. 2.00
Question

38

Correct

The correct answer is: 2.00

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 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

ISDS 702 Test #2

Question

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?

Keep your own graph.

Select one:

a. 0
b. 2
c. 10
d. 6
Question

40

Correct
Mark 1.00 out
of 1.00

e. 4

The correct answer is: 0

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

Consider the following linear programming problem:

MAXIMIZE 3X + 10Y

s.t. 3X + 4Y 480 .... (1)

4X + 2Y 360 .... (2) X, Y 0

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

The correct answer is: 1 non-binding-constraint

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?

Keep your own graph.

Select one:
a. There is only one nonbinding constraint line.
b. There are three nonbinding constraint
lines.

c. There are two nonbinding constraint lines.

d. There are four nonbinding constraint
lines.

e. There is no nonbinding constraint

line.
The correct answer is: There is only one nonbinding constraint line.

Question

43

Correct
Mark 1.00 out
of 1.00

Refer to your own graph on HW #4 in Module 3.

MAXIMIZE 49 X + 53Y

s.t. 2X + 4Y 23 .... (1)

-X + 4Y 10 ......(2)

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.

c. line #4 and line #5.

d. line #2 and line #5.
e. line #1 and line #2.
Question

44

Correct
Mark 1.00 out
of 1.00

The correct answer is: line #1 and line #2.

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

The correct answer is '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.

b. S* changes but M* remains the same.

c. Both S* and M* remain the same.
d. S* remains the same, but M* changes.

The correct answer is: Both S* and M* change.

Question

46

Correct
Mark 1.00 out
of 1.00

Given the following linear programming (LP) problem:

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 first constraint?

Keep your own graph.

Select one:

a. S1* = 6
b. S1* = 5
c. S1* =
4 d. S1*

e.

S1* = 0
Question

47

Correct
Mark 1.00 out
of 1.00

The correct answer is: S1* = 6

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

How would this constraint be written?

ISDS 702 Test #2

Question

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?

Keep your own graph.

Select one:
a. Both S1 and S2 are slack.

b. S1 is surplus, and S2 is slack.

c. Both S1 and S2 are surplus.

d. S1 is slack, and S2 is surplus.

Question

49

Correct
Mark 1.00 out
of 1.00

The correct answer is: Both S1 and S2 are slack.

Graphically solve the following linear programming (LP) problem:

MAXIMIZE

$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.

b. The dual price for the 1st constraint must be zero.

The correct answer is: 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.

Information regarding cost and exposure is given in the table below:

audience

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

b. Minimize 800T + 1000N + 400R

c. Minimize 10T + 7N + 20R

d. Maximize 7000T + 8500N + 3000R

e. Maximize 10T + 7N + 20R
The correct answer is: Maximize 7000T + 8500N + 3000R