QNT 5160 QUIZ #5 CHAPTER 2, 3 & 5
QUESTION 1. A linear programming problem where the objective is to
match employees to an equal number of tasks at a minimum costs is called:
A resource-allocation
problem
A matching problem
An assignment problem
A cost-benefit tradeoff
problem
None of the above
0.5 points
Q U E S T I O N 2 Which of the following is true about linear programming
problems:
Linear programming problems may have multiple goals or
objectives specified
Linear programming problems always have an objective function
and at least two constraints
Linear programming problems always involve minimizing an
objective function
An example of a decision variable in a linear programming
problem is profit maximization
Constraints in a linear programming problem limit the
alternatives available to a decision maker
0.5 points
Q U E S T I O N 3 The production planner for Fine Coffees, Inc. produces two
coffee blends: American (A) and British (B). He can only get 300 pounds of
Colombian beans per week and 200 pounds of Dominican beans per week.
Each pound of American blend coffee requires 12 ounces of Colombian beans
and 4 ounces of Dominican beans, while a pound of British blend coffee uses
8 ounces of each type of bean. Profits for the American blend are $2.00 per
pound, and profits for the British blend are $1.00 per pound.
What is the constraint for Dominican beans?
12A + 8B ≤
4,800
8A + 12B ≤
4,800
4A + 8B ≤
3,200
8A + 4B ≤
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 18:24:49 GMT -06:00
https://www.coursehero.com/file/16781227/final-quiz-5/
, 3,200
4A + 8B ≤
4,800
0.5 points
Q U E S T I O N 4 An electronics firm produces two models of pocket calculators:
the A-100 (A) and the B-200 (B). Each model uses one circuit board, of which
there are only 2,500 available for this week's production. In addition, the
company has allocated a maximum of 800 hours of assembly time this week
for producing these calculators. Each A-100 requires 15 minutes to produce
while each B-200 requires 30 minutes to produce. The firm forecasts that it
could sell a maximum of 4,000 of the A-100s this week and a maximum of
1,000 B-200s. Profits for the A-100 are $1.00 each and profits for the B-200
are $4.00 each.
Which of the following is NOT a feasible solution?
(A, B) = (0, 0)
(A, B) = (0,
1000)
(A, B) = (1800,
700)
(A, B) = (2500,
0)
(A, B) = (100,
1600)
0.5 points
Q U E S T I O N 5 A manager does NOT necessarily have to know the following
things about linear programming:
The practical value of linear programming for solving real
business problems
The relevance and applicability of linear programming in various
business situations
The difference between competent and shoddy studies using
linear programing
The technical details of a large model formulation and validation
All of the above
0.5 points
Q U E S T I O N 6 What is the feasible solution for the following problem?
Maximize P = 3x + 15y
subject to 2x + 4y ≤ 12
5x + 2y ≤ 10
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 18:24:49 GMT -06:00
https://www.coursehero.com/file/16781227/final-quiz-5/
QUESTION 1. A linear programming problem where the objective is to
match employees to an equal number of tasks at a minimum costs is called:
A resource-allocation
problem
A matching problem
An assignment problem
A cost-benefit tradeoff
problem
None of the above
0.5 points
Q U E S T I O N 2 Which of the following is true about linear programming
problems:
Linear programming problems may have multiple goals or
objectives specified
Linear programming problems always have an objective function
and at least two constraints
Linear programming problems always involve minimizing an
objective function
An example of a decision variable in a linear programming
problem is profit maximization
Constraints in a linear programming problem limit the
alternatives available to a decision maker
0.5 points
Q U E S T I O N 3 The production planner for Fine Coffees, Inc. produces two
coffee blends: American (A) and British (B). He can only get 300 pounds of
Colombian beans per week and 200 pounds of Dominican beans per week.
Each pound of American blend coffee requires 12 ounces of Colombian beans
and 4 ounces of Dominican beans, while a pound of British blend coffee uses
8 ounces of each type of bean. Profits for the American blend are $2.00 per
pound, and profits for the British blend are $1.00 per pound.
What is the constraint for Dominican beans?
12A + 8B ≤
4,800
8A + 12B ≤
4,800
4A + 8B ≤
3,200
8A + 4B ≤
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 18:24:49 GMT -06:00
https://www.coursehero.com/file/16781227/final-quiz-5/
, 3,200
4A + 8B ≤
4,800
0.5 points
Q U E S T I O N 4 An electronics firm produces two models of pocket calculators:
the A-100 (A) and the B-200 (B). Each model uses one circuit board, of which
there are only 2,500 available for this week's production. In addition, the
company has allocated a maximum of 800 hours of assembly time this week
for producing these calculators. Each A-100 requires 15 minutes to produce
while each B-200 requires 30 minutes to produce. The firm forecasts that it
could sell a maximum of 4,000 of the A-100s this week and a maximum of
1,000 B-200s. Profits for the A-100 are $1.00 each and profits for the B-200
are $4.00 each.
Which of the following is NOT a feasible solution?
(A, B) = (0, 0)
(A, B) = (0,
1000)
(A, B) = (1800,
700)
(A, B) = (2500,
0)
(A, B) = (100,
1600)
0.5 points
Q U E S T I O N 5 A manager does NOT necessarily have to know the following
things about linear programming:
The practical value of linear programming for solving real
business problems
The relevance and applicability of linear programming in various
business situations
The difference between competent and shoddy studies using
linear programing
The technical details of a large model formulation and validation
All of the above
0.5 points
Q U E S T I O N 6 What is the feasible solution for the following problem?
Maximize P = 3x + 15y
subject to 2x + 4y ≤ 12
5x + 2y ≤ 10
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 18:24:49 GMT -06:00
https://www.coursehero.com/file/16781227/final-quiz-5/
