QNT 2020 FINAL EXAM QUESTIONS WITH VERIFIED
ANSWERS
Linear programming problems may have multiple goals or objectives specified. -
Answers - False
When using the graphical method, the region that satisfies all of the constraints of a
linear programming problem is called the: - Answers - Feasible Region
A feasible solution is one that satisfies all the constraints of a linear programming
problem simultaneously. - Answers - True
The best feasible solution is called the optimal solution. - Answers - True
Constraints limit the alternatives available to a decision maker. - Answers - True
All constraints in a linear programming problem are either ≤ or ≥ inequalities. - Answers
- False
An example of a decision variable in a linear programming problem is profit
maximization. - Answers - False
The equation 5x + 7y = 10 is linear. - Answers - True
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. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the objective function? - Answers - P = 2A + B.
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. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the constraint for Colombian beans? - Answers - 12A + 8B ≤ 4,800.
ANSWERS
Linear programming problems may have multiple goals or objectives specified. -
Answers - False
When using the graphical method, the region that satisfies all of the constraints of a
linear programming problem is called the: - Answers - Feasible Region
A feasible solution is one that satisfies all the constraints of a linear programming
problem simultaneously. - Answers - True
The best feasible solution is called the optimal solution. - Answers - True
Constraints limit the alternatives available to a decision maker. - Answers - True
All constraints in a linear programming problem are either ≤ or ≥ inequalities. - Answers
- False
An example of a decision variable in a linear programming problem is profit
maximization. - Answers - False
The equation 5x + 7y = 10 is linear. - Answers - True
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. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the objective function? - Answers - P = 2A + B.
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. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the constraint for Colombian beans? - Answers - 12A + 8B ≤ 4,800.
