Your Results for "Multiple Choice" http://wps.prenhall.

com/wps/grader

Your Results for: "Multiple Choice" Print this page

Site Title: Operations Management, 10/e and Summary of Results

Principles of Operations Management,
8/e 79% Correct of 14 Scored items:
11 Correct: 79%
Book Title: Operations Management, 10/e and
3 Incorrect: 21%
Principles of Operations Management,
8/e More information about scoring
Book Author: Heizer
Location on Module B: Linear Programming >
Site: Self-Study Quizzes > Multiple Choice
Date/Time September 14, 2014 at 7:46 AM
Submitted: (UTC/GMT)

When using a graphical solution procedure, the region bounded by the set of
1. constraints is called the

Your Answer: feasible region.

CORRECT.

Which of the following is NOT a property of linear programming problems?

2.
Your Answer: usage of only linear equations and inequalities
Correct Answer: one course of action

INCORRECT. This is one property.

A feasible solution to a linear programming problem

3.
Your Answer: must satisfy all of the problem's constraints simultaneously.

CORRECT.

Consider the following linear programming problem:

4.
Maximize 12X + 10Y

Subject to: 4X + 3Y = 480

2X + 3Y = 360

all variables ³ 0

The maximum possible profit for the objective function is

1TRIAL
of 4 MODE − a valid license will remove this message. See the keywords property of this PDF for more information. 9/14/2014 2:47 AM
Your Results for "Multiple Choice" http://wps.prenhall.com/wps/grader

Your Answer: 1520.

CORRECT.

Consider the following linear programming problem:

5.
Maximize 12X + 10Y

Subject to: 4X + 3Y = 480

2X + 3Y = 360

all variables ³ 0

Which of the following points (X,Y) is not feasible?

Your Answer: (70,70)

CORRECT.

Consider the following linear programming problem:

6.
Maximize 4X + 10Y

Subject to: 3X + 4Y = 480

4X + 2Y = 360

all variables ³ 0

The feasible corner points are (48,84), (0,120), (0,0), and (90,0). What is the
maximum possible value for the objective function?

Your Answer: 1200

CORRECT.

Which of the following is NOT an example of an application of linear programming?

7.
Your Answer: calculating the wages for an hourly worker if the time worked is
unknown

CORRECT.

Which of the following is a mathematical expression in linear programming that

8. maximizes or minimizes some quantity?

2TRIAL
of 4 MODE − a valid license will remove this message. See the keywords property of this PDF for more information. 9/14/2014 2:47 AM
Your Results for "Multiple Choice" http://wps.prenhall.com/wps/grader

Your Answer: objective function

CORRECT.

A seamstress has 30 yards of cloth and 20 yards of thread to make small, medium,
9. or large shirts. Each small shirt takes 0.75 yards of cloth and 0.5 yards of thread;
each medium shirt takes 1 yard of cloth and 0.7 yards of thread, and each large
shirt takes 1.2 yards of cloth and 0.9 yards of thread. Each type of shirt takes 30
minutes to sew and the seamstress has 16 hours of time she can devote to sewing.
A large shirt sells for $15, a medium for $12, and a small for $10. Using S for small,
M for medium, L for large, C for cloth, T for thread, and H for hours, what is an
appropriate objective function for this problem?

Your Answer: Max Profit=15L+12M+10S

CORRECT.

A seamstress has 30 yards of cloth and 20 yards of thread to make small, medium,
10. or large shirts. Each small shirt takes 0.75 yards of cloth and 0.5 yards of thread;
each medium shirt takes 1 yard of cloth and 0.7 yards of thread, and each large
shirt takes 1.2 yards of cloth and 0.9 yards of thread. Each type of shirt takes 30
minutes to sew and the seamstress has 16 hours of time she can devote to sewing.
A large shirt sells for $15, a medium for $12, and a small for $10. Using S for small,
M for medium, L for large, C for cloth, T for thread, and H for hours, what is an
appropriate constraint for this problem?

Your Answer: 0.75S+1M+1.2L < 30

CORRECT.

An LP modeler examines her sensitivity report and notes that the final value for
11. item X is 200, and the shadow price is $2 with an allowable increase of 10 and an
allowable decrease of 25. Which of the following statements is best?

Your Answer: $2 is the most the LP modeler should be willing to pay for an
additional unit of item X.

CORRECT.

In the objective function Max Z = 8U+4C+2O, the number 8 is a

12.
Your Answer: constraint.
Correct Answer: parameter.

3TRIAL
of 4 MODE − a valid license will remove this message. See the keywords property of this PDF for more information. 9/14/2014 2:47 AM
Your Results for "Multiple Choice" http://wps.prenhall.com/wps/grader

INCORRECT. A constraint is some linear combination of decision variables.

When using the graphical method of linear programming

13.
Your Answer: each decision variable has its own dimension in the graph.

CORRECT.

The simplex method of linear programming is valuable when

14.
Your Answer: There are more than two constraints.
Correct Answer: There are more than two decision variables.

INCORRECT. Simplex may be used in this situation, but this is not the best answer.

E-mail Your Results

My name is (first last):

E-mail my results to:

E-mail address: Send as:

Me

Instructor

TA

Other

Help

Copyright © 1995 - 2013 Pearson Education . All rights reserved. Pearson Prentice Hall is an imprint of Pearson .
Legal Notice | Privacy Policy | Permissions

4TRIAL
of 4 MODE − a valid license will remove this message. See the keywords property of this PDF for more information. 9/14/2014 2:47 AM